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.
Volume (Year): 18 (2001)
Issue (Month): 2 ()
|Note:||Received: 15 October 1997/Accepted: 17 March 1999|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm |
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:18:y:2001:i:2:p:303-326. 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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.