IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-00193996.html
   My bibliography  Save this paper

Duality and optimal strategies in the finitely repeated zero-sum games with incomplete information on both sides

Author

Listed:
  • Bernard de Meyer

    (CERMSEM - CEntre de Recherche en Mathématiques, Statistique et Économie Mathématique - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Alexandre Marino

    (CERMSEM - CEntre de Recherche en Mathématiques, Statistique et Économie Mathématique - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

Abstract

The recursive formula for the value of the zero-sum repeated games with incomplete information on both sides is known for a long time. As it is explained in the paper, the usual proof of this formula is in a sense non constructive: it just claims that the players are unable to guarantee a better payoff than the one prescribed by formula, but it does not indicates how the players can guarantee this amount. In this paper we aim to give a constructive approach to this formula using duality techniques. This will allow us to recursively describe the optimal strategies in those games and to apply these results to games with infinite action spaces.

Suggested Citation

  • Bernard de Meyer & Alexandre Marino, 2005. "Duality and optimal strategies in the finitely repeated zero-sum games with incomplete information on both sides," Post-Print halshs-00193996, HAL.
    • Handle: RePEc:hal:journl:halshs-00193996
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00193996
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00193996/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bernard De Meyer & Alexandre Marino, 2004. "Repeated market games with lack of information on both sides," Cahiers de la Maison des Sciences Economiques bla04066, Université Panthéon-Sorbonne (Paris 1).
    2. DE MEYER , Bernard, 1993. "Repeated Games and the Central Limit Theorem," LIDAM Discussion Papers CORE 1993003, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    2. Bernard De Meyer & Ehud Lehrer & Dinah Rosenberg, 2010. "Evaluating Information in Zero-Sum Games with Incomplete Information on Both Sides," Mathematics of Operations Research, INFORMS, vol. 35(4), pages 851-863, November.

    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. Bernard De Meyer & Alexandre Marino, 2005. "Duality and optimal strategies in the finitely repeated zero-sum games with incomplete information on both sides," Cahiers de la Maison des Sciences Economiques b05027, Université Panthéon-Sorbonne (Paris 1).
    2. Fedor Sandomirskiy, 2018. "On Repeated Zero-Sum Games with Incomplete Information and Asymptotically Bounded Values," Dynamic Games and Applications, Springer, vol. 8(1), pages 180-198, March.
    3. 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.
    4. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    5. VIEILLE, Nicolas & ROSENBERG, Dinah & SOLAN, Eilon, 2002. "Stochastic games with a single controller and incomplete information," HEC Research Papers Series 754, HEC Paris.
    6. Fabien Gensbittel, 2015. "Extensions of the Cav( u ) Theorem for Repeated Games with Incomplete Information on One Side," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 80-104, February.
    7. Bernard De Meyer & Ehud Lehrer & Dinah Rosenberg, 2010. "Evaluating Information in Zero-Sum Games with Incomplete Information on Both Sides," Mathematics of Operations Research, INFORMS, vol. 35(4), pages 851-863, November.
    8. R. Buckdahn & P. Cardaliaguet & M. Quincampoix, 2011. "Some Recent Aspects of Differential Game Theory," Dynamic Games and Applications, Springer, vol. 1(1), pages 74-114, March.
    9. Fabien Gensbittel & Miquel Oliu-Barton, 2020. "Optimal Strategies in Zero-Sum Repeated Games with Incomplete Information: The Dependent Case," Dynamic Games and Applications, Springer, vol. 10(4), pages 819-835, December.
    10. Fedor Sandomirskiy, 2014. "Repeated games of incomplete information with large sets of states," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 767-789, November.
    11. P. Cardaliaguet, 2008. "Representations Formulas for Some Differential Games with Asymmetric Information," Journal of Optimization Theory and Applications, Springer, vol. 138(1), pages 1-16, July.
    12. Alexandre Marino & Bernard De Meyer, 2005. "Continuous versus Discrete Market Games," Cowles Foundation Discussion Papers 1535, Cowles Foundation for Research in Economics, Yale University.

    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:hal:journl:halshs-00193996. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.