IDEAS home Printed from
   My bibliography  Save this paper

Existence of Optimal Strategies in Markov Games with Incomplete Information


  • Abraham Neyman



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.

Suggested Citation

  • Abraham Neyman, 2005. "Existence of Optimal Strategies in Markov Games with Incomplete Information," Discussion Paper Series dp413, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  • Handle: RePEc:huj:dispap:dp413

    Download full text from publisher

    File URL:
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    1. Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, January.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications, Elsevier.
    2. Johannes Horner & Dinah Rosenberg & Eilon Solan & Nicolas Vieille, 2009. "On a Markov Game with One-Sided Incomplete Information," Cowles Foundation Discussion Papers 1737, Cowles Foundation for Research in Economics, Yale University.
    3. Johannes Hörner & Dinah Rosenberg & Eilon Solan & Nicolas Vieille, 2010. "On a Markov Game with One-Sided Information," Operations Research, INFORMS, vol. 58(4-part-2), pages 1107-1115, August.
    4. Fabien Gensbittel & Jérôme Renault, 2015. "The Value of Markov Chain Games with Incomplete Information on Both Sides," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 820-841, October.
    5. Johannes Hörner & Satoru Takahashi & Nicolas Vieille, 2015. "Truthful Equilibria in Dynamic Bayesian Games," Econometrica, Econometric Society, vol. 83(5), pages 1795-1848, September.
    6. Pierre Cardaliaguet & Catherine Rainer & Dinah Rosenberg & Nicolas Vieille, 2016. "Markov Games with Frequent Actions and Incomplete Information—The Limit Case," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 49-71, February.
    7. Jérôme Renault, 2012. "The Value of Repeated Games with an Informed Controller," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 154-179, February.
    8. Sylvain Sorin, 2011. "Zero-Sum Repeated Games: Recent Advances and New Links with Differential Games," Dynamic Games and Applications, Springer, vol. 1(1), pages 172-207, March.
    9. Bruno Ziliotto, 2016. "A Tauberian Theorem for Nonexpansive Operators and Applications to Zero-Sum Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1522-1534, November.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp413. 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: (Michael Simkin). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.