Journal of the Operations Research Society of China ›› 2024, Vol. 12 ›› Issue (1): 169-187.doi: 10.1007/s40305-023-00502-3

• • 上一篇    下一篇

  

  • 收稿日期:2023-02-22 修回日期:2023-05-30 出版日期:2024-03-30 发布日期:2024-03-13

Zero-Sum Continuous-Time Markov Games with One-Side Stopping

Yurii Averboukh1,2   

  1. 1. Laboratory of Stochastic Analysis and Its Applications, National Research University Higher School of Economics (HSE), Moscow, 109028, Russia;
    2. Department of Differential Equations, Krasovskii Institute of Mathematics and Mechanics, Yekaterinburg, 620108, Russia
  • Received:2023-02-22 Revised:2023-05-30 Online:2024-03-30 Published:2024-03-13
  • Contact: Yurii Averboukh E-mail:averboukh@gmail.com
  • Supported by:
    The article was prepared within the framework of the HSE University Basic Research Program in 2023.

Abstract: The paper is concerned with a variant of the continuous-time finite state Markov game of control and stopping where both players can affect transition rates, while only one player can choose a stopping time. The dynamic programming principle reduces this problem to a system of ODEs with unilateral constraints. This system plays the role of the Bellman equation. We show that its solution provides the optimal strategies of the players. Additionally, the existence and uniqueness theorem for the deduced system of ODEs with unilateral constraints is derived.

Key words: Continuous-time Markov games, Dynamic programming, Verification theorem, Stopping time

中图分类号: