Belief Affirming in Learning Processes

    • preprint
    • Published in RePEc
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.
All Related Versions

This publication has 0 references indexed in Scilit: