IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v213y2023ics0022053123001096.html
   My bibliography  Save this article

A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff

Author

Listed:
  • Dargaj, Jakub
  • Simonsen, Jakob Grue

Abstract

It is well-known that for infinitely repeated games, there are computable strategies that have best responses, but no computable best responses. These results were originally proved for either specific games (e.g., Prisoner's dilemma), or for classes of games satisfying certain conditions not known to be both necessary and sufficient.

Suggested Citation

  • Dargaj, Jakub & Simonsen, Jakob Grue, 2023. "A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff," Journal of Economic Theory, Elsevier, vol. 213(C).
    • Handle: RePEc:eee:jetheo:v:213:y:2023:i:c:s0022053123001096
    DOI: 10.1016/j.jet.2023.105713
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022053123001096
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jet.2023.105713?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.

    More about this item

    Keywords

    Repeated games; Limit-of-means payoff; Computability; Best response strategies; Subgame-perfect equilibria;
    All these 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
    • Y80 - Miscellaneous Categories - - Related Disciplines - - - Related Disciplines

    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:eee:jetheo:v:213:y:2023:i:c:s0022053123001096. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622869 .

    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.