IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v131y2015icp47-49.html
   My bibliography  Save this article

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 search 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. Lipman, Barton L. & Wang, Ruqu, 2000. "Switching Costs in Frequently Repeated Games," Journal of Economic Theory, Elsevier, vol. 93(2), pages 149-190, August.
    3. 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.
    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. David Baron & Ehud Kalai, 1990. "Dividing a Cake by Majority: The Simplest Equilibria," Discussion Papers 919, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Tracy Xiao Liu & Jenna Bednar & Yan Chen & Scott Page, 2019. "Directional behavioral spillover and cognitive load effects in multiple repeated games," Experimental Economics, Springer;Economic Science Association, vol. 22(3), pages 705-734, September.
    3. Jehiel, Philippe, 1998. "Learning to Play Limited Forecast Equilibria," Games and Economic Behavior, Elsevier, vol. 22(2), pages 274-298, February.
    4. Samuelson, Larry & Swinkels, Jeroen M., 2003. "Evolutionary stability and lexicographic preferences," Games and Economic Behavior, Elsevier, vol. 44(2), pages 332-342, August.
    5. Rubinstein, A. & Wolnsky, A., 1992. "A Rermark on Infinitely Repeated Extensive Games," Papers 4-92, Tel Aviv - the Sackler Institute of Economic Studies.
    6. Hamid Sabourian & Jihong Lee, 2004. "Complexity and Efficiency in Repeated Games with Negotiation," Econometric Society 2004 Far Eastern Meetings 401, Econometric Society.
    7. Daijiro Okada & Abraham Neyman, 2004. "Growing Strategy Sets in Repeated Games," Econometric Society 2004 North American Summer Meetings 625, Econometric Society.
    8. Jehiel, Philippe, 2005. "Analogy-based expectation equilibrium," Journal of Economic Theory, Elsevier, vol. 123(2), pages 81-104, August.
    9. Ho, Teck-Hua, 1996. "Finite automata play repeated prisoner's dilemma with information processing costs," Journal of Economic Dynamics and Control, Elsevier, vol. 20(1-3), pages 173-207.
    10. Beal, Sylvain & Querou, Nicolas, 2007. "Bounded rationality and repeated network formation," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
    11. Justin Smith, 1999. "Strategic Cost and ‘Matching Pennies’," Working Papers 99-07-048, Santa Fe Institute.
    12. Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
    13. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
    14. Conlisk, John, 1996. "Bounded rationality and market fluctuations," Journal of Economic Behavior & Organization, Elsevier, vol. 29(2), pages 233-250, March.
    15. Nachbar, John H & Zame, William R, 1996. "Non-computable Strategies and Discounted Repeated Games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122, June.
    16. Luca Anderlini & Leonardo Felli, 1999. "Incomplete Contracts and Complexity Costs," Theory and Decision, Springer, vol. 46(1), pages 23-50, February.
    17. Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
    18. Spiegler, Ran, 2004. "Simplicity of beliefs and delay tactics in a concession game," Games and Economic Behavior, Elsevier, vol. 47(1), pages 200-220, April.
    19. Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2004. "The Folk Theorem in Dynastic Repeated Games," Cowles Foundation Discussion Papers 1490, Cowles Foundation for Research in Economics, Yale University.
    20. Anderlini, Luca & Sabourian, Hamid, 2001. "Cooperation and computability in n-player games," Mathematical Social Sciences, Elsevier, vol. 42(2), pages 99-137, September.

    More about this item

    Keywords

    Guerilla; Repeated games; Imperfect monitoring; Agility; Organizational behavior; Hysteresis;
    All these 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.