IDEAS home Printed from https://ideas.repec.org/p/tse/wpaper/31602.html

How Fast Do Equilibrium Payo Sets Converge in Repeated Games?

Author

Listed:
  • Hörner, Johannes
  • Takahashi, Satoru

Abstract

We provide tight bounds on the rate of convergence of the equilibrium payoff sets for repeated games under both perfect and imperfect public monitoring. The distance between the equilibrium payoff set and its limit vanishes at rate (1−δ)1/2 under perfect monitoring, and at rate (1−δ)1/4 under imperfect monitoring. For strictly individually rational payoff vectors, these rates improve to 0 (i.e., all strictly individually rational payoff vectors are exactly achieved as equilibrium payoffs for δ high enough) and (1−δ)1/2, respectively.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Hörner, Johannes & Takahashi, Satoru, 2017. "How Fast Do Equilibrium Payo Sets Converge in Repeated Games?," TSE Working Papers 17-792, Toulouse School of Economics (TSE).
    • Handle: RePEc:tse:wpaper:31602
    as

    Download full text from publisher

    File URL: https://www.tse-fr.eu/sites/default/files/TSE/documents/doc/by/horner/rate_of_convergence03.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. is not listed on IDEAS
    2. Ani Dasgupta & Sambuddha Ghosh, 2017. "Repeated Games Without Public Randomization: A Constructive Approach," Boston University - Department of Economics - Working Papers Series WP2017-011, Boston University - Department of Economics, revised Feb 2019.
    3. Meng, Delong, 2021. "On the value of repetition for communication games," Games and Economic Behavior, Elsevier, vol. 127(C), pages 227-246.
    4. Sugaya, Takuo & Wolitzky, Alexander, 2025. "Non-recursive dynamic incentives: a rate of convergence approach," Theoretical Economics, Econometric Society, vol. 20(4), November.
    5. Joyee Deb & Takuo Sugaya & Alexander Wolitzky, 2020. "The Folk Theorem in Repeated Games With Anonymous Random Matching," Econometrica, Econometric Society, vol. 88(3), pages 917-964, May.
    6. Matan Harel & Elchanan Mossel & Philipp Strack & Omer Tamuz, 2021. "Rational Groupthink," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 136(1), pages 621-668.
      • Matan Harel & Elchanan Mossel & Philipp Strack & Omer Tamuz, 2014. "Rational Groupthink," Papers 1412.7172, arXiv.org, revised Jun 2020.
    7. Dasgupta, Ani & Ghosh, Sambuddha, 2022. "Self-accessibility and repeated games with asymmetric discounting," Journal of Economic Theory, Elsevier, vol. 200(C).
    8. Mira Frick & Ryota Iijima & Yuhta Ishii, 2023. "Monitoring with Rich Data," Papers 2312.16789, arXiv.org, revised Jul 2024.

    More about this item

    Keywords

    ;
    ;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:tse:wpaper:31602. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/tsetofr.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.