CFDP 1511R

This paper shows that linking a suﬀiciently large number of independent but unrelated social decisions can achieve approximate eﬀiciency. We provide regularity conditions under which a Groves mechanism amended with a veto game implements an eﬀicient outcome with probability arbitrarily close to one, and satisﬁes interim participation, incentive and resource constraints.