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...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.展开更多
基金The article was prepared within the framework of the HSE University Basic Research Program in 2023。
文摘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.
