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

Uniform value in recursive games

Author

Listed:
  • Eilon Solan

    (TAU - Tel Aviv University)

  • Nicolas Vieille

    (GREGH - Groupement de Recherche et d'Etudes en Gestion à HEC - HEC Paris - Ecole des Hautes Etudes Commerciales - CNRS - Centre National de la Recherche Scientifique)

Abstract

We address the problem of existence of the uniform value in recursive games. We give two existence results: (i) the uniform value is shown to exist if the state space is countable, the action sets are finite and if, for some $a>0$, there are finitely many states in which the limsup value is less than $a$; (ii) for games with nonnegative payoff function, it is sufficient that the action set of player 2 is finite. The finiteness assumption can be further weakened.

Suggested Citation

  • Eilon Solan & Nicolas Vieille, 2002. "Uniform value in recursive games," Post-Print hal-00465002, HAL.
    • Handle: RePEc:hal:journl:hal-00465002
    DOI: 10.1214/aoap/1037125859
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Dinah Rosenberg & Eilon Solan & Nicolas Vieille, 1999. "Stopping Games with Randomized Strategies," Discussion Papers 1258, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Mertens, Jean-Francois, 2002. "Stochastic games," 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 47, pages 1809-1832, Elsevier.
    3. Piercesare Secchi, 1997. "Stationary Strategies for Recursive Games," Mathematics of Operations Research, INFORMS, vol. 22(2), pages 494-512, May.
    4. repec:dau:papers:123456789/6231 is not listed on IDEAS
    5. Nicolas Vieille & Dinah Rosenberg, 2000. "The Maxmin of Recursive Games with Incomplete Information on one Side," Post-Print hal-00481429, HAL.
    6. Mertens,Jean-François & Sorin,Sylvain & Zamir,Shmuel, 2015. "Repeated Games," Cambridge Books, Cambridge University Press, number 9781107030206, October.
      • Mertens,Jean-François & Sorin,Sylvain & Zamir,Shmuel, 2015. "Repeated Games," Cambridge Books, Cambridge University Press, number 9781107662636, October.
    7. Truman Bewley & Elon Kohlberg, 1976. "The Asymptotic Theory of Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 1(3), pages 197-208, August.
    8. Ehud Lehrer & Sylvain Sorin, 1992. "A Uniform Tauberian Theorem in Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 17(2), pages 303-307, May.
    9. Nowak, Andrzej S. & Szajowski, Krzysztof, 1998. "Nonzero-sum Stochastic Games," MPRA Paper 19995, University Library of Munich, Germany, revised 1999.
    10. Dinah Rosenberg & Nicolas Vieille, 2000. "The Maxmin of Recursive Games with Incomplete Information on one Side," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 23-35, February.
    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. Hugo Gimbert & Jérôme Renault & Sylvain Sorin & Xavier Venel & Wieslaw Zielonka, 2016. "On the values of repeated games with signals," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01006951, HAL.
    3. János Flesch & P. Jean-Jacques Herings & Jasmine Maes & Arkadi Predtetchinski, 2021. "Subgame Maxmin Strategies in Zero-Sum Stochastic Games with Tolerance Levels," Dynamic Games and Applications, Springer, vol. 11(4), pages 704-737, December.
    4. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," Post-Print hal-01302553, HAL.
    5. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01302553, HAL.
    6. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," PSE-Ecole d'économie de Paris (Postprint) hal-01302553, HAL.

    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. 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.
    2. Eilon Solan, 2002. "Subgame-Perfection in Quitting Games with Perfect Information and Differential Equations," Discussion Papers 1356, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. 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.
    4. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01302553, HAL.
    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. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    7. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," PSE-Ecole d'économie de Paris (Postprint) hal-01302553, HAL.
    8. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," Post-Print hal-01302553, HAL.
    9. Eilon Solan & Nicolas Vieille, 2010. "Computing uniformly optimal strategies in two-player stochastic games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 237-253, January.
    10. Shmaya, Eran & Solan, Eilon, 2004. "Zero-sum dynamic games and a stochastic variation of Ramsey's theorem," Stochastic Processes and their Applications, Elsevier, vol. 112(2), pages 319-329, August.
    11. 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.
    12. 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.
    13. Eilon Solan, 2005. "Subgame-Perfection in Quitting Games with Perfect Information and Differential Equations," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 51-72, February.
    14. 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.
    15. Anna Jaśkiewicz & Andrzej Nowak, 2011. "Stochastic Games with Unbounded Payoffs: Applications to Robust Control in Economics," Dynamic Games and Applications, Springer, vol. 1(2), pages 253-279, June.
    16. M. K. Ghosh & D. McDonald & S. Sinha, 2004. "Zero-Sum Stochastic Games with Partial Information," Journal of Optimization Theory and Applications, Springer, vol. 121(1), pages 99-118, April.
    17. Solan, Eilon & Vieille, Nicolas, 2003. "Deterministic multi-player Dynkin games," Journal of Mathematical Economics, Elsevier, vol. 39(8), pages 911-929, November.
    18. Solan, Eilon & Vieille, Nicolas, 2002. "Correlated Equilibrium in Stochastic Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 362-399, February.
    19. 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.
    20. Hansen, Kristoffer Arnsfelt & Ibsen-Jensen, Rasmus & Neyman, Abraham, 2021. "Absorbing games with a clock and two bits of memory," Games and Economic Behavior, Elsevier, vol. 128(C), pages 213-230.

    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:hal-00465002. 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.