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...

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...

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 purpose of this paper is to reexamine the seminal belief elicitation experiment by Nyarko and Schotter (2002) under the prism of pattern recognition. Instead of modeling elicited beliefs by a standard weighted fictitious play model this paper proposes a generalized variant of fictitious...

Agent-based modelling is an attractive way of finding equilibria in complex problems involving strategic behaviour, particularly in electricity markets with transmission constraints. However, while it may be possible to demonstrate convergence of learning behaviour to a Nash equilibrium, that is...