A Constructive Proof that Learning in Repeated Games Leads to Nash Equilibria
AbstractThis paper extends the convergence result in Kalai and Lehrer (1993a, 1993b) to a class of games where players have a payoff function continuous for the product topology. Provided that 1) every player maximizes her expected payoff against her own beliefs, 2) every player updates her beliefs in a Bayesian manner, and 3) prior beliefs of other players' strategies have a grain of truth, we construct a Nash equilibrium such that, after some finite time, the equilibrium outcome of the above game is arbitrarily close to the constructed Nash equilibrium.
Download InfoIf 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by De Gruyter in its journal The B.E. Journal of Theoretical Economics.
Volume (Year): 8 (2009)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.degruyter.com
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Peter Golla).
If references are entirely missing, you can add them using this form.