Advanced Search
MyIDEAS: Login to save this paper or follow this series

Prediction, Optimization, and Learning in Repeated Games

Contents:

Author Info

  • John H. Nachbar

    (Washington University, St. Louis)

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://128.118.178.162/eps/game/papers/9504/9504001.pdf
Download Restriction: no

File URL: http://128.118.178.162/eps/game/papers/9504/9504001.tex
Download Restriction: no

File URL: http://128.118.178.162/eps/game/papers/9504/9504001.ps.gz
Download Restriction: no

Bibliographic Info

Paper provided by EconWPA in its series Game Theory and Information with number 9504001.

as in new window
Length: 46 pages
Date of creation: 11 Apr 1995
Date of revision: 14 Feb 1996
Handle: RePEc:wpa:wuwpga:9504001

Note: Postscript from AMS-LaTeX, 46 pages
Contact details of provider:
Web page: http://128.118.178.162

Related research

Keywords: Repeated games; rational learning; Bayesian learning.;

Other versions of this item:

Find related papers by JEL classification:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  2. Binmore, Ken, 1987. "Modeling Rational Players: Part I," Economics and Philosophy, Cambridge University Press, vol. 3(02), pages 179-214, October.
  3. Lawrence Blume & David Easley, 1993. "Rational Expectations and Rational Learning," Game Theory and Information 9307003, EconWPA.
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 in new window

Cited by:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:9504001. 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: (EconWPA).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 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.