IDEAS home Printed from
   My bibliography  Save this article

Finite Rationality and Interpersonal Complexity in Repeated Games


  • Kalai, Ehud
  • Stanford, William


Finite complexity strategies suffice for approximating all subgame perfect equ ilibrium payoffs of repeated games. Generically, at such equilibria, no player's complexity exceeds the product of his opponents' complexi ties. Also, no player's memory exceeds the maximal memory of his oppo nents. The complexity of a strategy is defined here to equal the numb er of distinct strategies it induces in the various subgames. It equa ls the size (number of states) of the smallest automaton describing i t and also the number of states of the smallest information system ne eded for the implementation of the strategy. Copyright 1988 by The Econometric Society.

Suggested Citation

  • Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
  • Handle: RePEc:ecm:emetrp:v:56:y:1988:i:2:p:397-410

    Download full text from publisher

    File URL:
    File Function: full text
    Download Restriction: Access to full text is restricted to JSTOR subscribers. See for details.

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    1. Drew Fudenberg & David Levine, 2008. "Subgame–Perfect Equilibria of Finite– and Infinite–Horizon Games," World Scientific Book Chapters,in: A Long-Run Collaboration On Long-Run Games, chapter 1, pages 3-20 World Scientific Publishing Co. Pte. Ltd..
    2. James W. Friedman, 1971. "A Non-cooperative Equilibrium for Supergames," Review of Economic Studies, Oxford University Press, vol. 38(1), pages 1-12.
    3. Stanford, William G., 1986. "Subgame perfect reaction function equilibria in discounted duopoly supergames are trivial," Journal of Economic Theory, Elsevier, vol. 39(1), pages 226-232, June.
    4. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    5. Radner, Roy, 1980. "Collusive behavior in noncooperative epsilon-equilibria of oligopolies with long but finite lives," Journal of Economic Theory, Elsevier, vol. 22(2), pages 136-154, April.
    6. Futia, Carl, 1977. "The complexity of economic decision rules," Journal of Mathematical Economics, Elsevier, vol. 4(3), pages 289-299, December.
    7. Stanford, William G., 1986. "On continuous reaction function equilibria in duopoly supergames with mean payoffs," Journal of Economic Theory, Elsevier, vol. 39(1), pages 233-250, June.
    8. Smale, Steve, 1980. "The Prisoner's Dilemma and Dynamical Systems Associated to Non-Cooperative Games," Econometrica, Econometric Society, vol. 48(7), pages 1617-1634, November.
    9. Kalai, Ehud & Samet, Dov & Stanford, William, 1988. "A Note on Reactive Equilibria in the Discounted Prisoner's Dilemma and Associated Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 17(3), pages 177-186.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Access and download statistics


    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:56:y:1988:i:2:p:397-410. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum). General contact details of provider: .

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

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.