IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/783.html
   My bibliography  Save this paper

Bounded Rationality and Strategic Complexity in Repeated Games

Author

Listed:
  • Ehud Kalai

Abstract

No abstract is available for this item.

Suggested Citation

  • Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  • Handle: RePEc:nwu:cmsems:783
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/783.pdf
    File Function: main text
    Download Restriction: no

    References listed on IDEAS

    as
    1. Kreps, David M. & Milgrom, Paul & Roberts, John & Wilson, Robert, 1982. "Rational cooperation in the finitely repeated prisoners' dilemma," Journal of Economic Theory, Elsevier, vol. 27(2), pages 245-252, August.
    2. Robert J. Aumann & Lloyd S. Shapley, 2013. "Long Term Competition -- A Game-Theoretic Analysis," Annals of Economics and Finance, Society for AEF, vol. 14(2), pages 627-640, November.
    3. James W. Friedman, 1971. "A Non-cooperative Equilibrium for Supergames," Review of Economic Studies, Oxford University Press, vol. 38(1), pages 1-12.
    4. 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.
    5. Gilboa, Itzhak & Samet, Dov, 1989. "Bounded versus unbounded rationality: The tyranny of the weak," Games and Economic Behavior, Elsevier, vol. 1(3), pages 213-221, September.
    6. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    7. Lipman, Barton L. & Srivastava, Sanjay, 1990. "Informational requirements and strategic complexity in repeated games," Games and Economic Behavior, Elsevier, vol. 2(3), pages 273-290, September.
    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. Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
    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. Rosenthal, Robert W., 1981. "Games of perfect information, predatory pricing and the chain-store paradox," Journal of Economic Theory, Elsevier, vol. 25(1), pages 92-100, August.
    12. Gilboa, Itzhak, 1988. "The complexity of computing best-response automata in repeated games," Journal of Economic Theory, Elsevier, vol. 45(2), pages 342-352, August.
    13. Eitan Zemel, 1985. "On Communication, Bounded Complexity, and Cooperation," Discussion Papers 685, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    14. Futia, Carl, 1977. "The complexity of economic decision rules," Journal of Mathematical Economics, Elsevier, vol. 4(3), pages 289-299, December.
    15. 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.
    16. 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)

    Citations

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


    Cited by:

    1. 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.
    2. Sylvain Béal, 2010. "Perceptron versus automaton in the finitely repeated prisoner’s dilemma," Theory and Decision, Springer, vol. 69(2), pages 183-204, August.
    3. 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.
    4. Kalai, E & Neme, A, 1992. "The Strength of a Little Perfection," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(4), pages 335-355.
    5. Carmona, Guilherme, 2003. "A Re-Interpretation of the Concept of Nash Equilibrium Based on the Notion of Social Institutions," FEUNL Working Paper Series wp425, Universidade Nova de Lisboa, Faculdade de Economia.
    6. Gilad Bavly & Abraham Neyman, 2003. "Online Concealed Correlation by Boundedly Rational Players," Discussion Paper Series dp336, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    7. Lance Fortnow & Rahul Santhanam, 2009. "Bounding Rationality by Discounting Time," Discussion Papers 1481, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    8. Hamid Sabourian, 2000. "Bargaining and Markets: Complexity and the Walrasian Outcome," Cowles Foundation Discussion Papers 1249, Cowles Foundation for Research in Economics, Yale University.
    9. Carmona, Guilherme, 2006. "On the Optimality of the Equality Matching Form of Sociality," FEUNL Working Paper Series wp489, Universidade Nova de Lisboa, Faculdade de Economia.
    10. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, University Library of Munich, Germany, revised 01 Jun 2004.
    11. Guilherme Carmona, 2003. "A Re-Interpretation of Nash Equilibrium Based on the Notion of Social Institutions," Game Theory and Information 0311005, University Library of Munich, Germany.
    12. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.

    More about this item

    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:nwu:cmsems:783. 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: (Fran Walker) The email address of this maintainer does not seem to be valid anymore. Please ask Fran Walker to update the entry or send us the correct email address. General contact details of provider: http://edirc.repec.org/data/cmnwuus.html .

    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.