IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v131y2015icp47-49.html

Agility in repeated games: An example

Author

Listed:
  • Spiegler, Ran

Abstract

I study a repeated matching-pennies game between players having limited “agility”: when player i decides to switch his action, it takes (geometrically distributed) time for the decision to be implemented. I characterize the unique Nash equilibrium in this game when the papers are sufficiently agile. Players obtain the same equilibrium payoff as in the benchmark game with unlimited agility. However, equilibrium behavior displays endogenous hysteresis, which is more pronounced for less agile players.

Suggested Citation

  • Spiegler, Ran, 2015. "Agility in repeated games: An example," Economics Letters, Elsevier, vol. 131(C), pages 47-49.
    • Handle: RePEc:eee:ecolet:v:131:y:2015:i:c:p:47-49
    DOI: 10.1016/j.econlet.2015.03.026
    as

    Download full text from publisher

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

    for a different version of it.

    References listed on IDEAS

    as
    1. Fudenberg, Drew & Ishii, Yuhta & Kominers, Scott Duke, 2014. "Delayed-response strategies in repeated games with observation lags," Journal of Economic Theory, Elsevier, vol. 150(C), pages 487-514.
    2. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
    3. Lipman, Barton L. & Wang, Ruqu, 2000. "Switching Costs in Frequently Repeated Games," Journal of Economic Theory, Elsevier, vol. 93(2), pages 149-190, August.
    4. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.

    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. Jehiel, Philippe, 2005. "Analogy-based expectation equilibrium," Journal of Economic Theory, Elsevier, vol. 123(2), pages 81-104, August.
    2. Beal, Sylvain & Querou, Nicolas, 2007. "Bounded rationality and repeated network formation," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
    3. Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
    4. Luca Anderlini & Leonardo Felli, 1999. "Incomplete Contracts and Complexity Costs," Theory and Decision, Springer, vol. 46(1), pages 23-50, February.
    5. Roman, Mihai Daniel, 2008. "Entreprises behavior in cooperative and punishment‘s repeated negotiations," MPRA Paper 37527, University Library of Munich, Germany, revised 05 Jan 2009.
    6. Hernández, Penélope & Solan, Eilon, 2016. "Bounded computational capacity equilibrium," Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
    7. Binmore, Ken & Piccione, Michele & Samuelson, Larry, 1998. "Evolutionary Stability in Alternating-Offers Bargaining Games," Journal of Economic Theory, Elsevier, vol. 80(2), pages 257-291, June.
    8. Eli Ben-Sasson & Adam Tauman Kalai & Ehud Kalai, 2006. "An Approach to Bounded Rationality," Discussion Papers 1439, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    9. Miller, John H., 1996. "The coevolution of automata in the repeated Prisoner's Dilemma," Journal of Economic Behavior & Organization, Elsevier, vol. 29(1), pages 87-112, January.
    10. Pedro Dal Bo & Guillaume R. Frochette, 2011. "The Evolution of Cooperation in Infinitely Repeated Games: Experimental Evidence," American Economic Review, American Economic Association, vol. 101(1), pages 411-429, February.
    11. Lee, Jihong & Sabourian, Hamid, 2007. "Coase theorem, complexity and transaction costs," Journal of Economic Theory, Elsevier, vol. 135(1), pages 214-235, July.
    12. Stennek, Johan, 1994. "Does Competition Make Firms More Flexible? A Study of Limited Managerial Cognition," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 3(2), pages 279-300, Summer.
    13. Mathevet, Laurent, 2018. "An axiomatization of plays in repeated games," Games and Economic Behavior, Elsevier, vol. 110(C), pages 19-31.
    14. Zhang, Huanren, 2018. "Errors can increase cooperation in finite populations," Games and Economic Behavior, Elsevier, vol. 107(C), pages 203-219.
    15. Jihong Lee & Hamid Sabourian, 2005. "Efficiency in Negotiation: Complexity and Costly Bargaining," Birkbeck Working Papers in Economics and Finance 0505, Birkbeck, Department of Economics, Mathematics & Statistics.
    16. Shorish, Jamsheed, 2018. "Blockchain State Machine Representation," SocArXiv eusxg, Center for Open Science.
    17. Bavly, Gilad & Peretz, Ron, 2019. "Limits of correlation in repeated games with bounded memory," Games and Economic Behavior, Elsevier, vol. 115(C), pages 131-145.
    18. Ruebeck, Christopher S., 1999. "Imitation dynamics in the repeated Prisoners' Dilemma: an exploratory example," Journal of Economic Behavior & Organization, Elsevier, vol. 40(1), pages 81-104, September.
    19. Hamid Sabourian & Jihong Lee, 2004. "Complexity and Efficiency in the Negotiation Game," Econometric Society 2004 North American Winter Meetings 82, Econometric Society.
    20. Egor Bronnikov & Elias Tsakas, 2025. "A robust measure of complexity," Papers 2501.09139, arXiv.org.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other

    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:ecolet:v:131:y:2015:i:c:p:47-49. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ecolet .

    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.