We consider a co-evolutionary model of social coordination and network formation where agents may decide on an action in a 2×2-coordination game and on whom to establish costly links to. We find that if agents may only support a limited number of links payoff dominant conventions will emerge in...

We consider minimum-effort games played in an arbitrary network. For a family of imitation behavioral rules, including Imitate the Best and the Proportional Imitation Rule, we show that inefficient conventions arise independently of the interaction structure, if information is limited to the...

We revisit a result by Kim and Wong (2010) showing that under global interactions any strict Nash equilibrium of a coordination game can be supported as long run equilibrium by properly adding dominated strategies. We show that in the circular city model of local interactions and in the torus...

We consider a population of agents, either finite or countably infinite, located on an arbitrary network. Agents interact directly only with their immediate neighbors, but are able to observe the behavior of (some) other agents beyond their interaction neighborhood, and learn from that behavior...

We consider partial bandwagon properties in the context of coordination games to capture the idea of weak network externalities. We then study a local interactions model where agents play a coordination game following a noisy best-reply process. We show that globally pairwise risk dominant...

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