Coordination and information in critical mass games: an experimental study

We present experimental results on a repeated coordination game with Pareto-ranked equilibria in which a payoff from choosing an action is positive only if a critical mass of players choose that action. We design a baseline version of the game in which payoffs remain constant for values above the critical mass, and an increasing returns version in which payoffs keep increasing for values above the critical mass. We test the predictive power of security and payoff-dominance under different information treatments. Our results show that convergence to the payoff-dominant equilibrium is the modal limit outcome when players have full information about others' previous round choices, while this outcome never occurs in the remaining treatments. The paths of play in some groups reveal a tacit dynamic coordination by which groups converge to the efficient equilibrium in a step-like manner. Moreover, the frequency and speed of convergence to the payoff-dominant equilibrium are higher, ceteris paribus, when increasing returns are present. Finally, successful coordination seems to crucially depend on players' willingness to signal to others the choice of the action supporting the efficient equilibrium. Copyright Kluwer Academic Publishers 2003(This abstract was borrowed from another version of this item.)