Explicit optimal value for Dynkinʹs stopping game

Under the One-step Look Ahead rule of Dynamic Programming, an explicit game value of Dynkinʹs stopping problem for a Markov chain is obtained by using a potential operator. The condition on the One-step rule could be extended to the k-step and infinity-step rule. We shall also decompose the game value as the sum of two explicit functions under these rules.