Showing 1 - 10 of 1,525
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
Persistent link: https://www.econbiz.de/10005159960
Persistent link: https://www.econbiz.de/10007693079
Persistent link: https://www.econbiz.de/10001246475
Persistent link: https://www.econbiz.de/10000951979
Persistent link: https://www.econbiz.de/10005409062
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
We investigate the paths of pure strategy profiles induced by the fictitious play process. We present rules that such paths must follow. Using these rules we prove that every non-degenerate 2*3 game has the continuous fictitious play property, that is, every continuous fictitious play process,...
Persistent link: https://www.econbiz.de/10005463635
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/10005463675
Persistent link: https://www.econbiz.de/10005159818