Showing 1 - 10 of 64
We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of...
Persistent link: https://www.econbiz.de/10011422207
We show that in symmetric two-player exact potential games, the simple decision rule "imitate-if-better" cannot be beaten by any strategy in a repeated game by more than the maximal payoff difference of the one-period game. Our results apply to many interesting games including examples like 2x2...
Persistent link: https://www.econbiz.de/10011422230
We show that for many classes of symmetric two-player games, the simple decision rule imitate-the-best can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of...
Persistent link: https://www.econbiz.de/10010282117
We show that for many classes of symmetric two-player games, the simple decision rule "imitate if-better'' can hardly be beaten by any strategy. We provide necessary and sufficient conditions for imitation to be unbeatable in the sense that there is no strategy that can exploit imitation as a...
Persistent link: https://www.econbiz.de/10013116365
Persistent link: https://www.econbiz.de/10015204587
We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of...
Persistent link: https://www.econbiz.de/10003949629
Persistent link: https://www.econbiz.de/10010336163
Persistent link: https://www.econbiz.de/10009685992
We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...
Persistent link: https://www.econbiz.de/10010366554
We show that for many classes of symmetric two-player games, the simple decision rule 'imitate-if-better' can hardly be beaten by any strategy. We provide necessary and sufficient conditions for imitation to be unbeatable in the sense that there is no strategy that can exploit imitation as a...
Persistent link: https://www.econbiz.de/10009544162