IDEAS home Printed from https://ideas.repec.org/a/ecm/emetrp/v69y2001i1p191-200.html
   My bibliography  Save this article

A Folk Theorem for Asynchronously Repeated Games

Author

Listed:
  • Yoon, Kiho

Abstract

We prove a Folk Theorem for asynchronously repeated games in which the set of players who may not be able to change their actions simultaneously. We impose a condition, the finite periods of inaction (FPI) condition, which requires that the number of periods in which every player has at least one opportunity to move is bounded. Given the FPI condition together with the standard nonequivalent utilities (NEU) condition, we show that every feasible and strictly individually rational payoff vector can be supported as a subgame perfect equilibrium outcome of an asynchronously repeated game.

Suggested Citation

  • Yoon, Kiho, 2001. "A Folk Theorem for Asynchronously Repeated Games," Econometrica, Econometric Society, vol. 69(1), pages 191-200, January.
    • Handle: RePEc:ecm:emetrp:v:69:y:2001:i:1:p:191-200
    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.

    Citations

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


    Cited by:

    1. Johannes Horner & Takuo Sugaya & Satoru Takahashi & Nicolas Vieille, 2009. "Recursive Methods in Discounted Stochastic Games: An Algorithm for delta Approaching 1 and a Folk Theorem," Cowles Foundation Discussion Papers 1742, Cowles Foundation for Research in Economics, Yale University, revised Aug 2010.
    2. Nicolas Vieille, 2010. "Recursive Methods in Discounted Stochastic Games: An Algorithm for - 1 and a Folk Theorem," Post-Print hal-00543616, HAL.
    3. Ansink, Erik & Houba, Harold, 2016. "Sustainable agreements on stochastic river flow," Resource and Energy Economics, Elsevier, vol. 44(C), pages 92-117.
    4. Quan Wen, 2002. "Repeated Games with Asynchronous Moves," Vanderbilt University Department of Economics Working Papers 0204, Vanderbilt University Department of Economics.
    5. Erik Ansink, 2009. "Self-enforcing Agreements on Water allocation," Working Papers 2009.73, Fondazione Eni Enrico Mattei.
    6. Haller, Hans & Lagunoff, Roger, 2010. "Markov Perfect equilibria in repeated asynchronous choice games," Journal of Mathematical Economics, Elsevier, vol. 46(6), pages 1103-1114, November.
    7. Sofia Moroni, 2018. "Games with Private Timing," Working Paper 6400, Department of Economics, University of Pittsburgh.
    8. , & , & , & ,, 2014. "Asynchronicity and coordination in common and opposing interest games," Theoretical Economics, Econometric Society, vol. 9(2), May.
    9. Takashi Kamihigashi & Taiji Furusawa, 2007. "Global Dynamics in Infinitely Repeated Games with Additively Separable Continuous Payoffs," Discussion Paper Series 210, Research Institute for Economics & Business Administration, Kobe University.
    10. Takahashi, Satoru & Wen, Quan, 2003. "On asynchronously repeated games," Economics Letters, Elsevier, vol. 79(2), pages 239-245, May.
    11. Doraszelski, Ulrich & Escobar, Juan F., 2019. "Protocol invariance and the timing of decisions in dynamic games," Theoretical Economics, Econometric Society, vol. 14(2), May.
    12. Yevgeny Tsodikovich, 2021. "The worst-case payoff in games with stochastic revision opportunities," Annals of Operations Research, Springer, vol. 300(1), pages 205-224, May.
    13. Sibdari, Soheil & Pyke, David F., 2014. "Dynamic pricing with uncertain production cost: An alternating-move approach," European Journal of Operational Research, Elsevier, vol. 236(1), pages 218-228.
    14. Takahashi, Satoru, 2005. "Infinite horizon common interest games with perfect information," Games and Economic Behavior, Elsevier, vol. 53(2), pages 231-247, November.

    More about this item

    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:ecm:emetrp:v:69:y:2001:i:1:p:191-200. 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/essssea.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.