A learning process is belief affirming if for each player, the difference between her expected payoff in the next period, and the average of her past payoffs converges to zero. We show that every smooth discrete fictitious play and every continuous fictitious play is belief affirming. We also provide conditions under which general averaging processes are belief affirming.
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.
Length: Date of creation: 11 Aug 1994 Date of revision:
11 Aug 1994 Handle: RePEc:wpa:wuwpga:9408002
Note: 14 p. AmS TeX. (for a PostScript file call samet@vm.tau.ac il). Contact details of provider: Web page: http://129.3.20.41
For technical questions regarding this item, or to correct its listing, contact: (EconWPA).
Related research
Keywords:
Find related papers by JEL classification: C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory D8 - Microeconomics - - Information, Knowledge, and Uncertainty
Cited by: (explanations, 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.)