IDEAS home Printed from https://ideas.repec.org/p/cla/levarc/576.html
   My bibliography  Save this paper

Prediction, Optimization and Learning in Repeated Games

Author

Listed:
  • John Nachbar

Abstract

Consider a two-player discounted repeated game in which each player optimizes with respect to prior beliefs about his opponent's repeated game strategy. One would like to argue that if beliefs are cautious then players will learn as the game unfolds to predict the continuation path of play. If this conjecture were true then a convergence result due to Kalai and Lehrer would imply that the continuation path would asymptotically resemble the path of a Nash equilibrium. One would thus have constructed a theory which predicts Nash equilibrium as the necessary long-run consequence of optimization by cautious players. This paper points out that there is an obstacle to such a result in the form of a potential conflict between prediction and optimization.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • John Nachbar, 2010. "Prediction, Optimization and Learning in Repeated Games," Levine's Working Paper Archive 576, David K. Levine.
    • Handle: RePEc:cla:levarc:576
    as

    Download full text from publisher

    File URL: http://www.dklevine.com/archive/refs4576.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    2. Binmore, Ken, 1987. "Modeling Rational Players: Part I," Economics and Philosophy, Cambridge University Press, vol. 3(2), pages 179-214, October.
    3. Lawrence Blume & David Easley, 1993. "Rational Expectations and Rational Learning," Game Theory and Information 9307003, University Library of Munich, Germany.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. R. M. Harstad & R. Selten, 2014. "Bounded-rationality models:tasks to become intellectually competitive," Voprosy Ekonomiki, NP Voprosy Ekonomiki, issue 5.
    6. Sergeyev, Dmitriy & Iovino, Luigi, 2018. "Central Bank Balance Sheet Policies Without Rational Expectations," CEPR Discussion Papers 13100, C.E.P.R. Discussion Papers.
    7. Varoufakis, Yanis, 2013. "Finite dynamic games with full rationality and inconsistently aligned beliefs: Can the N-person backward induction deliver a solution?," International Journal of Development and Conflict, Gokhale Institute of Politics and Economics, vol. 3(1), pages 63-70.
    8. Van Damme, Eric, 2002. "Strategic equilibrium," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 41, pages 1521-1596, Elsevier.
    9. Olivier Compte & Andrew Postlewaite, 2007. "Effecting Cooperation," PIER Working Paper Archive 09-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 29 May 2009.
    10. Benjamin Patrick Evans & Mikhail Prokopenko, 2021. "Bounded rationality for relaxing best response and mutual consistency: The Quantal Hierarchy model of decision-making," Papers 2106.15844, arXiv.org, revised Mar 2023.
    11. Beal, Sylvain & Querou, Nicolas, 2007. "Bounded rationality and repeated network formation," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
    12. Philippe Jehiel, 2022. "Analogy-Based Expectation Equilibrium and Related Concepts:Theory, Applications, and Beyond," PSE Working Papers halshs-03735680, HAL.
    13. Hannu Vartiainen, 2009. "A Simple Model of Secure Public Communication," Theory and Decision, Springer, vol. 67(1), pages 101-122, July.
    14. Kossykh Yulia & Sarychev Andrey, 2000. "Tales of Contract Enforcement in Transition," EERC Working Paper Series 98-267e, EERC Research Network, Russia and CIS.
    15. Nagel, Rosemarie & Bühren, Christoph & Frank, Björn, 2017. "Inspired and inspiring: Hervé Moulin and the discovery of the beauty contest game," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 191-207.
    16. Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
    17. Fontana, Magda, 2010. "Can neoclassical economics handle complexity? The fallacy of the oil spot dynamic," Journal of Economic Behavior & Organization, Elsevier, vol. 76(3), pages 584-596, December.
    18. Katerina Sherstyuk, 2011. "Complexity and bidder behavior in iterative auctions," Economics Bulletin, AccessEcon, vol. 31(4), pages 2769-2776.
    19. George J. Mailath & : Wojciech Olszewski, 2008. "Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring, Second Version," PIER Working Paper Archive 08-027, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 28 Jul 2008.
    20. Caspar Oesterheld, 2019. "Robust program equilibrium," Theory and Decision, Springer, vol. 86(1), pages 143-159, February.

    More about this item

    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:cla:levarc:576. 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: David K. Levine (email available below). General contact details of provider: http://www.dklevine.com/ .

    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.