Belief Affirming in Learning Processes

Dov Monderer, Dov Samet and Aner Sela

Game Theory and Information from EconWPA

Abstract: 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.

JEL-codes: C7 D8 (search for similar items in EconPapers)
Date: 1994-08-11, Revised 1994-08-11
Note: 14 p. AmS TeX. (for a PostScript file call samet@vm.tau.ac il).
View citations in EconPapers

Downloads: (external link)
http://129.3.20.41/eps/game/papers/9408/9408002.pdf (application/pdf)
http://129.3.20.41/eps/game/papers/9408/9408002.ps.gz (application/postscript)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:wpa:wuwpga:9408002

Access Statistics for this paper

More papers in Game Theory and Information from EconWPA
Series data maintained by EconWPA ().