Strategy-Proof Allocation of Multiple Public Goods
Författare
Summary, in English
We characterize the set of strategy-proof social choice functions (SCFs), the outcome of which are multiple public goods. The set of feasible alternatives is a subset of a product set with a finite number of elements. We do not require the SCFs to be ‘onto’, but instead impose the weaker requirement that every element in each category of public goods is attained at some preference profile. Admissible preferences are arbitrary rankings of the goods in the various categories, while a separability restriction concerning preferences among the various categories is assumed. We find that the range of the SCF is uniquely decomposed into a product set in general coarser than the original product set, and that the SCF must be dictatorial in each component of the range. If the range cannot be decomposed at all, the SCF is dictatorial in spite of the separability assumption on preferences, and a form of the Gibbard-Satterthwaite theorem with a restricted preference domain is obtained.
Avdelning/ar
Publiceringsår
2005
Språk
Engelska
Publikation/Tidskrift/Serie
Working Papers, Department of Economics, Lund University
Issue
2005:3
Länkar
Dokumenttyp
Working paper
Förlag
S-WoPEc. Scandinavian Working Papers in Economics
Ämne
- Economics
Nyckelord
- Strategy-proof
- multiple public goods
- decomposabi
Status
Published