IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v83y2014icp45-52.html
   My bibliography  Save this article

Strategic complexity in repeated extensive games

Author

Listed:
  • Muto, Nozomu

Abstract

This paper studies a machine (finite automaton) playing a two-player repeated game of a simple extensive-form game with perfect information. We introduce a new complexity measure called multiple complexity which incorporates a strategyʼs responsiveness to information in the stage game as well as the number of states of the machine. We completely characterize the Nash equilibrium of the machine game. In the sequential-move prisonerʼs dilemma, cooperation can be sustained as an equilibrium.

Suggested Citation

  • Muto, Nozomu, 2014. "Strategic complexity in repeated extensive games," Games and Economic Behavior, Elsevier, vol. 83(C), pages 45-52.
    • Handle: RePEc:eee:gamebe:v:83:y:2014:i:c:p:45-52
    DOI: 10.1016/j.geb.2013.10.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825613001450
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2013.10.007?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. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    2. Piccione, Michele, 1992. "Finite automata equilibria with discounting," Journal of Economic Theory, Elsevier, vol. 56(1), pages 180-193, February.
    3. Piccione Michele & Rubinstein Ariel, 1993. "Finite Automata Play a Repeated Extensive Game," Journal of Economic Theory, Elsevier, vol. 61(1), pages 160-168, October.
    4. Yuval Salant, 2011. "Procedural Analysis of Choice Rules with Applications to Bounded Rationality," American Economic Review, American Economic Association, vol. 101(2), pages 724-748, April.
    5. Lee, Jihong & Sabourian, Hamid, 2007. "Coase theorem, complexity and transaction costs," Journal of Economic Theory, Elsevier, vol. 135(1), pages 214-235, July.
    6. Douglas Gale & Hamid Sabourian, 2005. "Complexity and Competition," Econometrica, Econometric Society, vol. 73(3), pages 739-769, May.
    7. Binmore, Kenneth G. & Samuelson, Larry, 1992. "Evolutionary stability in repeated games played by finite automata," Journal of Economic Theory, Elsevier, vol. 57(2), pages 278-305, August.
    8. 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.
    9. Sabourian, Hamid, 2004. "Bargaining and markets: complexity and the competitive outcome," Journal of Economic Theory, Elsevier, vol. 116(2), pages 189-228, June.
    10. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
    11. Kalyan Chatterjee & Hamid Sabourian, 2000. "Multiperson Bargaining and Strategic Complexity," Econometrica, Econometric Society, vol. 68(6), pages 1491-1510, November.
    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. Oren Bar-Gill & Christoph Engel, 2020. "Property is Dummy Proof: An Experiment," Discussion Paper Series of the Max Planck Institute for Research on Collective Goods 2020_02, Max Planck Institute for Research on Collective Goods.

    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. Hamid Sabourian & Jihong Lee, 2004. "Complexity and Efficiency in Repeated Games with Negotiation," Econometric Society 2004 Far Eastern Meetings 401, Econometric Society.
    2. Hernández, Penélope & Solan, Eilon, 2016. "Bounded computational capacity equilibrium," Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
    3. 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.
    4. Lee, J. & Sabourian, H., 2004. "Complexity and Efficiency in Repeated Games and Negotiation," Cambridge Working Papers in Economics 0419, Faculty of Economics, University of Cambridge.
    5. Lee, Jihong & Sabourian, Hamid, 2007. "Coase theorem, complexity and transaction costs," Journal of Economic Theory, Elsevier, vol. 135(1), pages 214-235, July.
    6. Hamid Sabourian & Jihong Lee, 2004. "Complexity and Efficiency in the Negotiation Game," Econometric Society 2004 North American Winter Meetings 82, Econometric Society.
    7. Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
    8. 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.
    9. Anderlini, Luca & Sabourian, Hamid, 2001. "Cooperation and computability in n-player games," Mathematical Social Sciences, Elsevier, vol. 42(2), pages 99-137, September.
    10. 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.
    11. Jones, Matthew T., 2014. "Strategic complexity and cooperation: An experimental study," Journal of Economic Behavior & Organization, Elsevier, vol. 106(C), pages 352-366.
    12. Lee, Jihong & Sabourian, Hamid, 2015. "Complexity and repeated implementation," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 259-292.
    13. Burkov, Andriy & Chaib-draa, Brahim, 2015. "Computing equilibria in discounted dynamic games," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 863-884.
    14. Jehiel, Philippe, 1998. "Learning to Play Limited Forecast Equilibria," Games and Economic Behavior, Elsevier, vol. 22(2), pages 274-298, February.
    15. Luca Anderlini & Leonardo Felli, 1999. "Incomplete Contracts and Complexity Costs," Theory and Decision, Springer, vol. 46(1), pages 23-50, February.
    16. 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.
    17. Yuval Salant & Jörg L. Spenkuch, 2021. "Complexity and Choice," CESifo Working Paper Series 9239, CESifo.
    18. Theodore Andronikos & Alla Sirokofskich & Kalliopi Kastampolidou & Magdalini Varvouzou & Konstantinos Giannakis & Alexander Singh, 2018. "Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game," Mathematics, MDPI, vol. 6(2), pages 1-26, February.
    19. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    20. Ortoleva, Pietro, 2013. "The price of flexibility: Towards a theory of Thinking Aversion," Journal of Economic Theory, Elsevier, vol. 148(3), pages 903-934.

    More about this item

    Keywords

    Strategic complexity; Finite automaton; Repeated game; Extensive game; Prisonerʼs dilemma; Multiple complexity;
    All these keywords.

    JEL classification:

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

    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:gamebe:v:83:y:2014:i:c:p:45-52. 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/inca/622836 .

    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.