Considering a pure coordination game with a large number of equivalent equilibria, we argue, first, that a focal point that is itself not a Nash equilibrium and is Pareto dominated by all Nash equilibria, may attract the players' choices. Second, we argue that such a non-equilibrium focal point...

Considering a pure coordination game with a large number of equivalent equilibria, we argue, first, that a focal point that is itself not a Nash equilibrium and is Pareto dominated by all Nash equilibria, may attract the players' choices. Second, we argue that such a non-equilibrium focal point...

We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash...

Considering a pure coordination game with a large number of equivalent equilibria, we argue, first, that a focal point that is itself not a Nash equilibrium and is Pareto dominated by all Nash equilibria, may attract the players' choices. Second, we argue that such a non-equilibrium focal point...

In Binary Threshold Public Good (BTPG) games players contribute or not to the production of a public good which is produced if and only if there are "enough" contributors. There is a plethora of equilibria in BTPG games. We experimentally test general theoretical attributes of equilibria and...

We consider a co-evolutionary model of social coordination and network formation where agents may decide on an action in a 2x2 - coordination game and on whom to establish costly links to. We find that a payoff dominant convention is selected for a wider parameter range when agents may only...

This paper extends Milgrom and Robert's treatment of supermodular games in two ways. It points out that their main characterization result holds under a weaker assumption. It refines the arguments to provide bounds on the set of strategies that survive iterated deletion of weakly dominated...

We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash...

A refinement of the set of Nash equilibria that satisfies two assumptions is shown to select a subset that is stable in the sense defined by Kohlberg and Mertens. One assumption requires that a selected set is invariant to adjoining redundant strategies and the other is a strong version of...

We propose a learning dynamic with agents using samples of past play to estimate the distribution of other players' strategy choices and best responding to this estimate. To account for noisy play, estimated distributions over other players' strategy choices have full support in the other...