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

In modern elections, ideologically motivated candidates with a wealth of information about individual voters and sophisticated campaign strategies are faced by voters who lack awareness of some political issues and are uncertain about the exact political positions of candidates. We study to what...

In modern elections, ideologically motivated candidates with a wealth of information about individual voters and sophisticated campaign strategies are faced by voters who lack awareness of some political issues and are uncertain about the exact political positions of candidates. This is the...

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

Applying unawareness belief structures introduced in Heifetz, Meier, and Schipper (2013a), we develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are extended naturally from lower to higher awareness levels and restricted from higher to lower...

We observe that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for...

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 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 provide a general notion of perfect Bayesian equilibrium which can be applied to arbitrary extensive-form games and is intermediate between subgame-perfect equilibrium and sequential equilibrium. The essential ingredient of the proposed definition is the qualitative notion of AGM-consistency,...

We define generalized extensive-form games which allow for mutual unawareness of actions. We extend Pearce's (1984) notion of extensive-form (correlated) rationalizability to this setting, explore its properties and prove existence. We define also a new variant of this solution concept, prudent...