Existence of optimal strategies in Markov games with incomplete information
The existence of a value and optimal strategies is proved for the class of twoperson 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.
(This abstract was borrowed from another version of this item.)
Volume (Year): 37 (2008)
Issue (Month): 4 (December)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00182/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, June.
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:37:y:2008:i:4:p:581-596. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.