In an (n,m)-coordination game, each of the n players has two alternative strategies. A strategy generates positive payoff only if there are at least m-1 others who choose the same, where mn/2. The payoff is nondecreasing in the number of such others so that there are exactly two strict...

We investigate the equilibrium selection problem in n-person binary coordination games by means of adaptive play with mistakes (Young 1993). The size and the depth of a particular type of basins of attraction are found to be the main factors in determining the selection outcome. The main result...

We investigate the equilibrium selection problem in n-person binary coordination games by means of the adaptive play with mistakes (Young 1993). We show that whenever the difference between the deviation losses of respective equilibria is not overwhelming, the stochastic stability exhibits a...