Showing 1 - 10 of 86
Recently there has been much theoretical and experimental work on learning in games. However, learning usually means … learning about the strategic behavior of opponents rather than learning about the game as such. In contrast, here we report on …
Persistent link: https://www.econbiz.de/10011539825
number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious … play, imitation, reinforcement learning, and a trial & error process. We test whether subjects try to influence those … and that all learning algorithms are subject to exploitation with the notable exception of imitation. The experiment was …
Persistent link: https://www.econbiz.de/10003379095
number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious … play, imitation, reinforcement learning, and a trial & error process. We test whether subjects try to influence those … and that all learning algorithms are subject to exploitation with the notable exception of imitation. The experiment was …
Persistent link: https://www.econbiz.de/10010366554
number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious … play, imitation, reinforcement learning, and a trial & error process. We test whether subjects try to influence those … and that all learning algorithms are subject to exploitation with the notable exception of imitation. The experiment was …
Persistent link: https://www.econbiz.de/10005407609
Recently there has been much work on learning in games. However, learning usually means "learning about behavior of … opponents" rather than "learning about the game" as such. Here we test in an experiment whether players in a repeated encounter …
Persistent link: https://www.econbiz.de/10014136483
Recently there has been much work on learning in games. However, learning usually means learning about behavior of … opponents rather than learning about the game as such. Here we test in an experiment whether players in a repeated encounter can …
Persistent link: https://www.econbiz.de/10014118207
We characterize the class of symmetric two-player games in which tit-for-tat cannot be beaten even by very sophisticated opponents in a repeated game. It turns out to be the class of exact potential games. More generally, there is a class of simple imitation rules that includes tit-for-tat but...
Persistent link: https://www.econbiz.de/10010318837
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/10010282072
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/10010282081
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