Showing 1 - 2 of 2
We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large...
Persistent link: https://www.econbiz.de/10005062361
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...
Persistent link: https://www.econbiz.de/10005550881