Skip to main content

Game Theory and Strategic Complexity

  • Living reference work entry
  • First Online:
Encyclopedia of Complexity and Systems Science

Definition

The subject of this entry is at the intersection of economics and computer science and deals with the use of measures of complexity obtained from the study of finite automata to help select among multiple equilibria and other outcomes appearing in game-theoretic models of bargaining, markets, and repeated interactions. The importance of the topic lies in the ability of concepts that employ bounds on available resources to generate more refined predictions of individual behavior in markets.

Introduction

This entry is concerned with the concept of strategic complexity and its use in game theory. There are many different meanings associated with the word “complexity,” as the variety of topics discussed in this volume makes clear. In this entry, we shall adopt a somewhat narrow view, confining ourselves to notions that measure, in some way, constraints on the ability of economic agents to behave with full rationality in their interactions with other agents in dynamic...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Abbreviations

Automata:

A formal definition of a strategy that captures its complexity.

Continuation Game:

A description of how the play will proceed in a dynamic game once some part of the game has already occurred.

Equilibrium:

A solution concept for games in which each player optimizes given his correct prediction of others’ behavior.

Equilibrium Path:

The outcome in terms of the play of the game if every player uses his equilibrium strategy.

Game Theory:

A formal model of interaction, usually in human behavior.

Repeated Games:

A series of identical interactions of this kind.

Strategic Complexity:

A measure of how complex a strategy is to implement.

Strategy:

A complete specification of how a player will play the game.

Bibliography

  • Abreu D, Rubinstein A (1988) The structure of Nash equilibria in repeated games with finite automata. Econometrica 56:1259–1282

    Article  MATH  MathSciNet  Google Scholar 

  • Anderlini L (1990) Some notes on church’s thesis and the theory of games. Theory Decis 29:19–52

    Article  MATH  MathSciNet  Google Scholar 

  • Anderlini L, Sabourian H (1995) Cooperation and effective computability. Econometrica 63:1337–1369

    Article  MATH  MathSciNet  Google Scholar 

  • Aumann RJ (1981) Survey of repeated games. In: Essays in game theory and mathematical economics in honor of Oskar Morgenstern. Bibliographisches Institut, Mannheim/Vienna/Zurich, pp 11–42

    Google Scholar 

  • Banks J, Sundaram R (1990) Repeated games, finite automata and complexity. Games Econ Behav 2:97–117

    Article  MATH  MathSciNet  Google Scholar 

  • Ben Porath E (1986) Repeated games with bounded complexity. Mimeo, StanfordUniversity, Stanford, Calif

    Google Scholar 

  • Ben Porath E (1993) Repeated games with finite automata. J Econ Theory 59:17–32

    Article  MATH  MathSciNet  Google Scholar 

  • Binmore KG (1987) Modelling rational players I. Econ Philos 3:179–214

    Article  Google Scholar 

  • Binmore KG, Samuelson L (1992) Evolutionary stability in repeated games played by finite automata. J Econ Theory 57:278–305

    Article  MATH  MathSciNet  Google Scholar 

  • Binmore KG, Piccione M, Samuelson L (1998) Evolutionary stability in alternating-offers bargaining games. J Econ Theory 80:257–291

    Article  MATH  MathSciNet  Google Scholar 

  • Birkhoff GD (1933) Aesthetic measure. Harvard University Press, Cambridge, MA

    Book  MATH  Google Scholar 

  • Bloise G (1998) Strategic complexity and equilibrium in repeated games. Unpublished doctoral dissertation, University of Cambridge

    Google Scholar 

  • Busch L-A, Wen Q (1995) Perfect equilibria in a negotiation model. Econometrica 63:545–565

    Article  MATH  Google Scholar 

  • Chatterjee K (2002) Complexity of strategies and multiplicity of Nash equilibria. Group Decis Negot 11:223–230

    Article  Google Scholar 

  • Chatterjee K, Sabourian H (2000a) Multiperson bargaining and strategic complexity. Econometrica 68:1491–1509

    Article  MATH  MathSciNet  Google Scholar 

  • Chatterjee K, Sabourian H (2000b) N-person bargaining and strategic complexity. Mimeo, University of Cambridge and the Pennsylvania State University, Cambridge, UK and University Park, Pa., USA

    Google Scholar 

  • Debreu G (1959) Theory of value. Yale University Press, New Haven/London

    MATH  Google Scholar 

  • Fernandez R, Glazer J (1991) Striking for a bargain between two completely informed agents. Am Econ Rev 81:240–252

    Google Scholar 

  • Fudenberg D, Maskin E (1990) Evolution and repeated games. Mimeo, Harvard University, Cambridge, Mass

    Google Scholar 

  • Fudenberg D, Tirole J (1991) Game theory. MIT Press, Cambridge, MA

    Google Scholar 

  • Gale D (2000) Strategic foundations of general equilibrium: dynamic matching and bargaining games. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Gale D, Sabourian H (2005) Complexity and competition. Econometrica 73:739–770

    Article  MATH  MathSciNet  Google Scholar 

  • Gale D, Sabourian H (2006) Markov equilibria in dynamic matching and bargaining games. Games Econ Behav 54:336–352

    Article  MATH  MathSciNet  Google Scholar 

  • Gale D, Sabourian H (2008) Complexity and competition II; endogenous matching. Mimeo, New York University, New York, USA/University of Cambridge, Cambridge, UK

    Google Scholar 

  • Haller H, Holden S (1990) A letter to the editor on wage bargaining. J Econ Theory 52:232–236

    Article  MATH  Google Scholar 

  • Hayek F (1945) The use of knowledge in society. Am Econ Rev 35:519–530

    Google Scholar 

  • Herrero M (1985) A strategic theory of market institutions. Unpublished doctoral dissertation, London School of Economics

    Google Scholar 

  • Kalai E, Neme A (1992) The strength of a little perfection. Int J Game Theory 20:335–355

    Article  MATH  MathSciNet  Google Scholar 

  • Kalai E, Stanford W (1988) Finite rationality and interpersonal complexity in repeated games. Econometrica 56:397–410

    Article  MATH  MathSciNet  Google Scholar 

  • Klemperer P (ed) (2000) The economic theory of auctions. Elgar, Northampton

    Google Scholar 

  • Lee J, Sabourian H (2007) Coase theorem, complexity and transaction costs. J Econ Theory 135:214–235

    Article  MATH  MathSciNet  Google Scholar 

  • Maenner E (2008) Adaptation and complexity in repeated games. Games Econ Behav 63:166–187

    Article  MATH  MathSciNet  Google Scholar 

  • Miller GA (1956) The magical number seven plus or minus two: Some limits on our capacity to process information. Psychol Rev 63:81–97

    Article  Google Scholar 

  • Neme A, Quintas L (1995) Subgame perfect equilibrium of repeated games with implementation cost. J Econ Theory 66:599–608

    Article  MATH  MathSciNet  Google Scholar 

  • Neyman A (1985) Bounded complexity justifies cooperation in the finitely-repeated Prisoners’ Dilemma. Econ Lett 19:227–229

    Article  MathSciNet  Google Scholar 

  • Neyman A (1997) Cooperation, repetition and automata in cooperation: game-theoretic approaches. In: Hart S, Mas-Colell A (eds) NATO ASI series F, vol 155. Springer, Berlin, pp 233–255

    Google Scholar 

  • Osborne M, Rubinstein A (1990) Bargaining and markets. Academic, New York

    MATH  Google Scholar 

  • Osborne M, Rubinstein A (1994) A course in game theory. MIT Press, Cambridge, MA

    MATH  Google Scholar 

  • Papadimitriou CH (1992) On games with a bounded number of states. Games Econ Behav 4:122–131

    Article  MATH  MathSciNet  Google Scholar 

  • Piccione M (1992) Finite automata equilibria with discounting. J Econ Theory 56:180–193

    Article  MATH  MathSciNet  Google Scholar 

  • Piccione M, Rubinstein A (1993) Finite automata play a repeated extensive game. J Econ Theory 61:160–168

    Article  MATH  MathSciNet  Google Scholar 

  • Robson A (2003) The evolution of rationality and the Red Queen. J Econ Theory 111:1–22

    Article  ADS  MATH  MathSciNet  Google Scholar 

  • Rubinstein A (1982) Perfect equilibrium in a bargaining model. Econometrica 50:97–109

    Article  MATH  MathSciNet  Google Scholar 

  • Rubinstein A (1986) Finite automata play the repeated Prisoners’ Dilemma. J Econ Theory 39:83–96

    Article  MATH  Google Scholar 

  • Rubinstein A (1998) Modeling bounded rationality. MIT Press, Cambridge, MA

    Google Scholar 

  • Rubinstein A, Wolinsky A (1990) Decentralized trading, strategic behaviour and the Walrasian outcome. Rev Econ Stud 57:63–78

    Article  MATH  MathSciNet  Google Scholar 

  • Sabourian H (2003) Bargaining and markets: complexity and the competitive outcome. J Econ Theory 116:189–228

    Article  MathSciNet  Google Scholar 

  • Selten R (1965) Spieltheoretische Behandlung eines Oligopolmodells mit Nachfrageträgheit. Z gesamte Staatswiss 12:201–324

    Google Scholar 

  • Shaked A (1986) A three-person unanimity game. In: The Los Angeles national meetings of the Institute of Management Sciences and the Operations Research Society of America, Mimeo, University of Bonn, Bonn, Germany

    Google Scholar 

  • Zemel E (1989) Small talk and cooperation: a note on bounded rationality. J Econ Theory 49:1–9

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

We wish to thank an anonymous referee and Jihong Lee for valuable comments that improved the exposition of this entry. We would also like to thank St. John’s College, Cambridge, and the Pennsylvania State University for funding Dr. Chatterjee’s stay in Cambridge at the time this entry was written.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kalyan Chatterjee .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Chatterjee, K., Sabourian, H. (2013). Game Theory and Strategic Complexity. In: Meyers, R. (eds) Encyclopedia of Complexity and Systems Science. Springer, New York, NY. https://doi.org/10.1007/978-3-642-27737-5_241-3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27737-5_241-3

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-3-642-27737-5

  • eBook Packages: Springer Reference Physics and AstronomyReference Module Physical and Materials ScienceReference Module Chemistry, Materials and Physics

Publish with us

Policies and ethics