IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1631-1647.html
   My bibliography  Save this article

The Folk Theorem for Repeated Games with Time-Dependent Discounting

Author

Listed:
  • Daehyun Kim

    (Economics and Management School of Wuhan University, Wuhan 430072, China)

  • Xiaoxi Li

    (Economics and Management School of Wuhan University, Wuhan 430072, China)

Abstract

This paper defines a general framework to study infinitely repeated games with time-dependent discounting in which we distinguish and discuss both time-consistent and -inconsistent preferences. To study the long-term properties of repeated games, we introduce an asymptotic condition to characterize the fact that players become more and more patient; that is, the discount factors at all stages uniformly converge to one. Two types of folk theorems are proven without the public randomization assumption: the asymptotic one, that is, the equilibrium payoff set converges to the feasible and individual rational set as players become patient, and the uniform one, that is, any payoff in the feasible and individual rational set is sustained by a single strategy profile that is an approximate subgame perfect Nash equilibrium in all games with sufficiently patient discount factors. We use two methods for the study of asymptotic folk theorem: the self-generating approach and the constructive proof. We present the constructive proof in the perfect-monitoring case and show that it can be extended to time-inconsistent preferences. The self-generating approach applies to the public-monitoring case but may not extend to time-inconsistent preferences because of a nonmonotonicity result.

Suggested Citation

  • Daehyun Kim & Xiaoxi Li, 2022. "The Folk Theorem for Repeated Games with Time-Dependent Discounting," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1631-1647, May.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1631-1647
    DOI: 10.1287/moor.2021.1183
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1183
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1183?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
    ---><---

    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:inm:ormoor:v:47:y:2022:i:2:p:1631-1647. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.