Efficient Coordination in Weakest-Link Games

doi:10.1093/restud/rdv040

Return

Efficient Coordination in Weakest-Link Games

2015-09-17

Arno Riedl

Ingrid M. T. Rohde

Martin Strobel

DOI：10.1093/restud/rdv040

Original

Save

View PDF

Abstract

En 中文

Coordination problems resembling weakest-link games with multiple Pareto ranked equilibria are ubiquitous in the economy and society. This makes it important to understand if and when agents are able to coordinate efficiently. Existing research on weakest-link games shows an overwhelming inability of people to coordinate on efficient equilibria, especially in larger groups. We show experimentally that freedom of neighbourhood choice overcomes the problem and leads to fully efficient coordination. This implies substantial welfare effects with achieved welfare being about 50% higher in games with neighbourhood choice than without it. We identify exclusion of low effort providers who in response start providing high effort as the simple but effective mechanism enforcing efficient coordination. A variety of other treatments show that the efficiency result as well as the identified mechanism are robust to changes in the information condition, payoff specification, and a substantial increase in group size. Moreover, we find that neighbourhood choice boosts efficiency even when exclusion does not materially affect the excluded agent. Our results are widely applicable on the societal and organizational level, e.g. containment of diseases, fight against terrorism, and co-authorship networks.

Keywords:

Efficient coordination

Weakest-link

Minimum effort

Neighbourhood choice

Experiment

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.