The maxmin of recursive games with incomplete information on one side (Q2757620)

This paper deals with a subclass of stochastic games, called recursive games, in which players receive a payoff 0 in all non-absorbing states. The model describes a two player zero-sum recursive game with lack of information on one side. NEWLINENEWLINENEWLINEThe authors prove the existence of the maxmin and give an example of a game that has no value (the minmax exists and is different from the maxmin). Besides, in their final conclusions, they discuss the case of recursive games with lack of information on both sides and give applications to complete information recursive games.