%0 Journal Article
%T Unbeatable Imitation
%A Peter Duersch
%A Joerg Oechssler
%A Burkhard C. Schipper
%J Computer Science
%D 2010
%I arXiv
%R 10.1016/j.geb.2012.05.002
%X 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 the rock-scissors-paper variety. Thus, in many interesting examples, like 2x2 games, Cournot duopoly, price competition, rent seeking, public goods games, common pool resource games, minimum effort coordination games, arms race, search, bargaining, etc., imitation cannot be beaten by much even by a very clever opponent.
%U http://arxiv.org/abs/1003.4274v1