Belief Affirming in Learning Processes
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.
(This abstract was borrowed from another version of this item.)
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.
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.:
- Vijay Krishna & Tomas Sjostrom, 1995.
"On the Convergence of Fictitious Play,"
Harvard Institute of Economic Research Working Papers
1717, Harvard - Institute of Economic Research.
- Sjostrom, T. & Krishna, V., 1995. "On the Convergence of Ficticious Play," Papers 04-95-07, Pennsylvania State - Department of Economics.
- Vijay Krishna & Tomas Sjostrom, 1995. "On the Convergence of Fictitious Play," Game Theory and Information 9503003, EconWPA.
- Vijay Krishna & T. Sjostrom, 2010. "On the Convergence of Fictitious Play," Levine's Working Paper Archive 417, David K. Levine.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:73:y:1997:i:2:p:438-452. 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: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.