IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v122y2020icp83-104.html
   My bibliography  Save this article

Solving two-state Markov games with incomplete information on one side

Author

Listed:
  • Ashkenazi-Golan, Galit
  • Rainer, Catherine
  • Solan, Eilon

Abstract

We study the optimal use of information in Markov games with incomplete information on one side and two states. We provide a finite-stage algorithm for calculating the limit value as the gap between stages goes to 0, and an optimal strategy for the informed player in the limiting game in continuous time. This limiting strategy induces an ϵ-optimal strategy for the informed player, provided the gap between stages is small. Our results demonstrate when the informed player should use her information and how.

Suggested Citation

  • Ashkenazi-Golan, Galit & Rainer, Catherine & Solan, Eilon, 2020. "Solving two-state Markov games with incomplete information on one side," Games and Economic Behavior, Elsevier, vol. 122(C), pages 83-104.
    • Handle: RePEc:eee:gamebe:v:122:y:2020:i:c:p:83-104
    DOI: 10.1016/j.geb.2020.04.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825620300506
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2020.04.004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fabien Gensbittel, 2019. "Continuous-Time Markov Games with Asymmetric Information," Dynamic Games and Applications, Springer, vol. 9(3), pages 671-699, September.
    2. Miquel Oliu-Barton, 2015. "Differential Games with Asymmetric and Correlated Information," Dynamic Games and Applications, Springer, vol. 5(3), pages 378-396, September.
    3. Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, December.
    4. R.J. Aumann & S. Hart (ed.), 2002. "Handbook of Game Theory with Economic Applications," Handbook of Game Theory with Economic Applications, Elsevier, edition 1, volume 3, number 3.
    5. Pierre Cardaliaguet & Catherine Rainer, 2009. "On a Continuous-Time Game with Incomplete Information," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 769-794, November.
    6. Aumann, Robert J. & Heifetz, Aviad, 2002. "Incomplete information," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 43, pages 1665-1686, Elsevier.
    7. 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.
    8. repec:dau:papers:123456789/6935 is not listed on IDEAS
    9. 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.
    10. repec:dau:papers:123456789/6927 is not listed on IDEAS
    11. Renault, Jérôme & Solan, Eilon & Vieille, Nicolas, 2017. "Optimal dynamic information provision," Games and Economic Behavior, Elsevier, vol. 104(C), pages 329-349.
    12. Jérôme Renault, 2006. "The Value of Markov Chain Games with Lack of Information on One Side," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 490-512, August.
    13. Nicky J. Welton & Howard H. Z. Thom, 2015. "Value of Information," Medical Decision Making, , vol. 35(5), pages 564-566, July.
    14. Jérôme Bolte & Stéphane Gaubert & Guillaume Vigeral, 2015. "Definable Zero-Sum Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 171-191, February.
    15. 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.
    16. Fabien Gensbittel & Christine Grün, 2019. "Zero-Sum Stopping Games with Asymmetric Information," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 277-302, February.
    17. MERTENS, Jean-François & ZAMIR, Shmuel, 1971. "The value of two-person zero-sum repeated games with lack of information on both sides," LIDAM Reprints CORE 154, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    18. John C. Harsanyi, 1967. "Games with Incomplete Information Played by "Bayesian" Players, I-III Part I. The Basic Model," Management Science, INFORMS, vol. 14(3), pages 159-182, November.
    19. 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.
    20. Abraham Neyman, 2008. "Existence of optimal strategies in Markov games with incomplete information," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(4), pages 581-596, December.
    21. Jeffrey C. Ely, 2017. "Beeps," American Economic Review, American Economic Association, vol. 107(1), pages 31-53, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Chen, Fang & Guo, Xianping, 2023. "Two-person zero-sum risk-sensitive stochastic games with incomplete reward information on one side," Stochastic Processes and their Applications, Elsevier, vol. 165(C), pages 218-245.
    2. Ashkenazi-Golan, Galit & Hernández, Penélope & Neeman, Zvika & Solan, Eilon, 2023. "Markovian persuasion with two states," LSE Research Online Documents on Economics 119970, London School of Economics and Political Science, LSE Library.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fabien Gensbittel, 2019. "Continuous-Time Markov Games with Asymmetric Information," Dynamic Games and Applications, Springer, vol. 9(3), pages 671-699, September.
    2. Fabien Gensbittel & Christine Grün, 2019. "Zero-Sum Stopping Games with Asymmetric Information," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 277-302, February.
    3. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    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. Koessler, Frederic & Laclau, Marie & Renault, Jérôme & Tomala, Tristan, 2022. "Long information design," Theoretical Economics, Econometric Society, vol. 17(2), May.
    6. Jérôme Renault & Xavier Venel, 2017. "Long-Term Values in Markov Decision Processes and Repeated Games, and a New Distance for Probability Spaces," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 349-376, May.
    7. Dhruva Kartik & Ashutosh Nayyar, 2021. "Upper and Lower Values in Zero-Sum Stochastic Games with Asymmetric Information," Dynamic Games and Applications, Springer, vol. 11(2), pages 363-388, June.
    8. Rida Laraki & Jérôme Renault, 2020. "Acyclic Gambling Games," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1237-1257, November.
    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.
    10. 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.
    11. Ashkenazi-Golan, Galit & Hernández, Penélope & Neeman, Zvika & Solan, Eilon, 2023. "Markovian persuasion with two states," LSE Research Online Documents on Economics 119970, London School of Economics and Political Science, LSE Library.
    12. Escobar, Juan F. & Llanes, Gastón, 2018. "Cooperation dynamics in repeated games of adverse selection," Journal of Economic Theory, Elsevier, vol. 176(C), pages 408-443.
    13. Guilhem Lecouteux, 2018. "Bayesian game theorists and non-Bayesian players," The European Journal of the History of Economic Thought, Taylor & Francis Journals, vol. 25(6), pages 1420-1454, November.
    14. 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.
    15. Renault, Jérôme & Solan, Eilon & Vieille, Nicolas, 2017. "Optimal dynamic information provision," Games and Economic Behavior, Elsevier, vol. 104(C), pages 329-349.
    16. Ehud Lehrer & Dimitry Shaiderman, 2022. "Markovian Persuasion with Stochastic Revelations," Papers 2204.08659, arXiv.org, revised May 2022.
    17. Guillaume Vigeral, 2013. "A Zero-Sum Stochastic Game with Compact Action Sets and no Asymptotic Value," Dynamic Games and Applications, Springer, vol. 3(2), pages 172-186, June.
    18. Dengwang Tang & Hamidreza Tavafoghi & Vijay Subramanian & Ashutosh Nayyar & Demosthenis Teneketzis, 2023. "Dynamic Games Among Teams with Delayed Intra-Team Information Sharing," Dynamic Games and Applications, Springer, vol. 13(1), pages 353-411, March.
    19. Salomon, Antoine & Forges, Françoise, 2015. "Bayesian repeated games and reputation," Journal of Economic Theory, Elsevier, vol. 159(PA), pages 70-104.
    20. Vieille, Nicolas, 2002. "Stochastic games: Recent results," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 48, pages 1833-1850, Elsevier.

    More about this item

    Keywords

    Repeated games with incomplete information on one side; Markov games; Value; Optimal strategy; Algorithm;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    Statistics

    Access and download statistics

    Corrections

    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:eee:gamebe:v:122:y:2020:i:c:p:83-104. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.