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

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric...

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 leading to Nash equilibrium in all finite games that a...

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

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

We provide an evolutionary foundation to evidence that in some situations humans maintain either optimistic or pessimistic attitudes towards uncertainty and are ignorant to relevant aspects of the environment. Players in strategic games face Knightian uncertainty about opponents' actions and...

We study experimentally persuasion games in which a sender (e.g., a seller) with private information provides verifiable but potentially vague information (e.g., about the quality of a product) to a receiver (e.g., a buyer). Various theoretical solution concepts such as sequential equilibrium or...

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 leading to Nash equilibrium in all finite games that a...

Equilibrium notions for games with unawareness in the literature cannot be interpreted as steady-states of a learning process because players may discover novel actions during play. In this sense, many games with unawareness are "self-destroying" as a player's representation of the game may...