Bayesian learning in repeated games of incomplete information
In Nachbar  and, more definitively, Nachbar , I argued that, for a large class of discounted infinitely repeated games of complete information (i.e. stage game payoff functions are common knowledge), it is impossible to construct a Bayesian learning theory in which player beliefs are simultaneously weakly cautious, symmetric, and consistent. The present paper establishes a similar impossibility theorem for repeated games of incomplete information, that is, for repeated games in which stage game payoff functions are private information.
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.
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.
Volume (Year): 18 (2001)
Issue (Month): 2 ()
|Note:||Received: 15 October 1997/Accepted: 17 March 1999|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/355|