Two-person zero-sum discounted semi-Markov games with incomplete reward information on one side

Abstract We consider two-person zero-sum semi-Markov games with incomplete reward information on one side under the expected discount criterion. First, we prove that the value function exists and satisfies the Shapley equation. From the Shapley equation, we construct an optimal policy for the informed player. Second, to show the existence of an optimal policy for the uninformed player, we introduce an auxiliary dual game and establish the relationship between the primal game and the dual game. By this relationship, we also prove the existence of the value function of the dual game, and then construct an optimal policy for the uninformed player in the primal game. Finally, we develop two iterative algorithms to compute $\varepsilon$ -optimal policies for the informed player and the uninformed player, respectively.