Existence of Optimal Strategies in Markov Games with Incomplete Information

Authors: 
Abraham Neyman
Abstract: 

The existence of a value and optimal strategies is proved for the class of two-person repeated games where the state follows a Markov chain independently of players' actions and at the beginning of each stage only player one is informed about the state. The results apply to the case of standard signaling where players' stage actions are observable, as well as to the model with general signals provided that player one has a nonrevealing repeated game strategy. The proofs reduce the analysis of these repeated games to that of classical repeated games with incomplete information on one side.

Date: 
December, 2005
Published in: 
Number: 
413