Overcoming Participation Constraints

This paper shows that linking a sufficiently large number of independent but unrelated social decisions can achieve approximate efficiency. We provide regularity conditions under which a Groves mechanism amended with a veto game implements an efficient outcome with probability arbitrarily close to one, and satisfies interim participation, incentive and resource constraints.