IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v8y2018i1d10.1007_s13235-017-0216-8.html
   My bibliography  Save this article

The Splitting Game: Value and Optimal Strategies

Author

Listed:
  • Miquel Oliu-Barton

    (Université Paris-Dauphine, PSL Research University, CNRS, CEREMADE)

Abstract

We introduce the dependent splitting game, a zero-sum stochastic game in which the players jointly control a martingale. This game models the transmission of information in repeated games with incomplete information on both sides, in the dependent case: The state variable represents the martingale of posterior beliefs. We establish the existence of the value for any fixed, general evaluation of the stage payoffs, as a function of the initial state. We then prove the convergence of the value functions, as the evaluation vanishes, to the unique solution of the Mertens–Zamir system of equations is established. From this result, we derive the convergence of the values of repeated games with incomplete information on both sides, in the dependent case, to the same function, as the evaluation vanishes. Finally, we establish a surprising result: Unlike repeated games with incomplete information on both sides, the splitting game has a uniform value. Moreover, we exhibit a couple of optimal stationary strategies for which the stage payoff and the state remain constant.

Suggested Citation

  • Miquel Oliu-Barton, 2018. "The Splitting Game: Value and Optimal Strategies," Dynamic Games and Applications, Springer, vol. 8(1), pages 157-179, March.
    • Handle: RePEc:spr:dyngam:v:8:y:2018:i:1:d:10.1007_s13235-017-0216-8
    DOI: 10.1007/s13235-017-0216-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-017-0216-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13235-017-0216-8?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. Mertens, J.-F. & Zamir, S., 1980. "Minmax and maxmin of repeated games with incomplete information," LIDAM Reprints CORE 433, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Heuer, M, 1992. "Asymptotically Optimal Strategies in Repeated Games with Incomplete Information," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(4), pages 377-392.
    3. Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, December.
    4. Rida Laraki, 2002. "The splitting game and applications," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(3), pages 359-376.
    5. Pierre Cardaliaguet & Rida Laraki & Sylvain Sorin, 2012. "A Continuous Time Approach for the Asymptotic Value in Two-Person Zero-Sum Repeated Games," Post-Print hal-00609476, HAL.
    6. 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).
    7. repec:dau:papers:123456789/6775 is not listed on IDEAS
    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. Frédéric Koessler & Marie Laclau & Tristan Tomala, 2022. "Interactive Information Design," Mathematics of Operations Research, INFORMS, vol. 47(1), pages 153-175, February.
    2. 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.
    3. Rida Laraki & Jérôme Renault, 2020. "Acyclic Gambling Games," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1237-1257, 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. Miquel Oliu-Barton, 2015. "Differential Games with Asymmetric and Correlated Information," Dynamic Games and Applications, Springer, vol. 5(3), pages 378-396, September.
    2. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    3. 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.
    4. Koessler, Frederic & Laclau, Marie & Renault, Jérôme & Tomala, Tristan, 2022. "Long information design," Theoretical Economics, Econometric Society, vol. 17(2), May.
    5. Pierre Cardaliaguet & Rida Laraki & Sylvain Sorin, 2012. "A Continuous Time Approach for the Asymptotic Value in Two-Person Zero-Sum Repeated Games," Post-Print hal-00609476, HAL.
    6. VIEILLE, Nicolas & ROSENBERG, Dinah & SOLAN, Eilon, 2002. "Stochastic games with a single controller and incomplete information," HEC Research Papers Series 754, HEC Paris.
    7. Rida Laraki & Jérôme Renault, 2020. "Acyclic Gambling Games," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1237-1257, November.
    8. Koessler, Frederic & Laclau, Marie & Renault, Jérôme & Tomala, Tristan, 2022. "Long information design," Theoretical Economics, Econometric Society, vol. 17(2), May.
    9. 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.
    10. Rida Laraki, 2010. "Explicit formulas for repeated games with absorbing states," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 53-69, March.
    11. 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.
    12. Abraham Neyman & Sylvain Sorin, 2010. "Repeated games with public uncertain duration process," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 29-52, March.
    13. Salomon, Antoine & Forges, Françoise, 2015. "Bayesian repeated games and reputation," Journal of Economic Theory, Elsevier, vol. 159(PA), pages 70-104.
    14. Rainer Buckdahn & Marc Quincampoix & Catherine Rainer & Yuhong Xu, 2016. "Differential games with asymmetric information and without Isaacs’ condition," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(4), pages 795-816, November.
    15. Bernard de Meyer & Ehud Lehrer & Dinah Rosenberg, 2009. "Evaluating information in zero-sum games with incomplete information on both sides," Post-Print halshs-00390625, HAL.
    16. Fabien Gensbittel & Catherine Rainer, 2018. "A Two-Player Zero-sum Game Where Only One Player Observes a Brownian Motion," Dynamic Games and Applications, Springer, vol. 8(2), pages 280-314, June.
    17. Chloe Jimenez & Marc Quincampoix & Yuhong Xu, 2016. "Differential Games with Incomplete Information on a Continuum of Initial Positions and without Isaacs Condition," Dynamic Games and Applications, Springer, vol. 6(1), pages 82-96, March.
    18. Frédéric Koessler & Marie Laclau & Jérôme Renault & Tristan Tomala, 2022. "Splitting games over finite sets," Post-Print halshs-03672222, HAL.
    19. Banas, Lubomir & Ferrari, Giorgio & Randrianasolo, Tsiry Avisoa, 2020. "Numerical Appromixation of the Value of a Stochastic Differential Game with Asymmetric Information," Center for Mathematical Economics Working Papers 630, Center for Mathematical Economics, Bielefeld University.
    20. 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.

    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:spr:dyngam:v:8:y:2018:i:1:d:10.1007_s13235-017-0216-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.