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

On a class of recursive games

Author

Listed:
  • Nicolas Vieille

    (CECO - Laboratoire d'économétrie de l'École polytechnique - X - École polytechnique - CNRS - Centre National de la Recherche Scientifique)

Abstract

This is a contribution to appear in Proceedings of the NATO ASI on Stochastic Games (editors: A. Neyman and S. Sorin). It deals with the existence of equilibrium payoffs in a class of recursive stochastic games.

Suggested Citation

  • Nicolas Vieille, 2002. "On a class of recursive games," Working Papers hal-00242998, HAL.
    • Handle: RePEc:hal:wpaper:hal-00242998
    Note: View the original document on HAL open archive server: https://hal.science/hal-00242998
    as

    Download full text from publisher

    File URL: https://hal.science/hal-00242998/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. J. Flesch & F. Thuijsman & O. J. Vrieze, 1996. "Recursive Repeated Games with Absorbing States," Mathematics of Operations Research, INFORMS, vol. 21(4), pages 1016-1022, November.
    Full references (including those not matched with items on IDEAS)

    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. Flesch, J. & Thuijsman, F. & Vrieze, O.J., 2007. "Stochastic games with additive transitions," European Journal of Operational Research, Elsevier, vol. 179(2), pages 483-497, June.
    2. Eilon Solan & Nicholas Vieille, 2001. "Quitting Games - An Example," Discussion Papers 1314, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Shmaya, Eran & Solan, Eilon & Vieille, Nicolas, 2003. "An application of Ramsey theorem to stopping games," Games and Economic Behavior, Elsevier, vol. 42(2), pages 300-306, February.
    4. Casilda Lasso de la Vega & Oscar Volij, 2020. "The value of a draw," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(4), pages 1023-1044, November.
    5. VIEILLE, Nicolas & SOLAN, Eilon, 2001. "Stopping games: recent results," HEC Research Papers Series 744, HEC Paris.
    6. Prasenjit Mondal, 2016. "On undiscounted semi-Markov decision processes with absorbing states," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(2), pages 161-177, April.
    7. Eilon Solan & Nicolas Vieille, 2001. "Quitting Games," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 265-285, May.
    8. Walker, Mark & Wooders, John & Amir, Rabah, 2011. "Equilibrium play in matches: Binary Markov games," Games and Economic Behavior, Elsevier, vol. 71(2), pages 487-502, March.
    9. Alpern, Steve & Gal, Shmuel & Solan, Eilon, 2010. "A sequential selection game with vetoes," Games and Economic Behavior, Elsevier, vol. 68(1), pages 1-14, January.
    10. Oscar Volij & Casilda Lasso de la Vega, 2016. "The Value Of A Draw In Quasi-Binary Matches," Working Papers 1601, Ben-Gurion University of the Negev, Department of Economics.
    11. 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.
    12. 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.
    13. Eran Schmaya & Eilon Solan & Nicolas Vieille, 2002. "Stopping games and Ramsey theorem," Working Papers hal-00242997, HAL.
    14. Eran Shmaya & Eilon Solan, 2002. "Two Player Non Zero-Sum Stopping Games in Discrete Time," Discussion Papers 1347, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    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:wpaper:hal-00242998. 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.