Consider a two-player discounted infinitely repeated game. A player's belief is a probability distribution over the opponent's repeated game strategies. This paper shows that, for a large class of repeated games, there are no beliefs that satisfy three conditions, learnability, consistency, and a diversity condition, CS. This impossibility theorem generalizes results in Nachbar (1997).
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by Institute of Social and Economic Research, Osaka University in its series ISER Discussion Paper with number
0597.
For technical questions regarding this item, or to correct its listing, contact: (Fumiko Matsumoto).
Related research
Keywords:
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.:
Matthew Jackson & Ehud Kalai, 1995.
"Social Learning in Recurring Games,"
Discussion Papers
1138, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
[Downloadable!]
Did you know? Citation analysis on IDEAS includes online papers that are freely accessible and whose text could be automatically analyzed, currently about 210000 papers.