Showing 1 - 10 of 11
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
We analyze a symmetric n-firm Cournot oligopoly with a heterogeneous population of optimizers and imitators. Imitators mimic the output decision of the most successful firms of the previous round à la Vega-Redondo (1997). Optimizers play a myopic best response to the opponents' previous output....
Persistent link: https://www.econbiz.de/10010366551
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
Equilibrium notions for games with unawareness in the literature cannot be interpreted as steady-states of a learning … interpreted as steady-state of both a discovery and learning process. …
Persistent link: https://www.econbiz.de/10012509154
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
Persistent link: https://www.econbiz.de/10001828702
Persistent link: https://www.econbiz.de/10001705446
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/10009569667
It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should … players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic …" or that "could learn itself". Rather, a player has an incentive to strategically teach such a learning opponent in order …
Persistent link: https://www.econbiz.de/10010516648
It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should … players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic … that could "learn itself". Rather, a player has an incentive to strategically teach such a learning opponent in order to …
Persistent link: https://www.econbiz.de/10011764914