Constrained-optimal strategy-proof assignment: beyond the Groves mechanisms

Yves Sprumont ()

Cahiers de recherche from Universite de Montreal, Departement de sciences economiques

Abstract: A single object must be allocated to at most one of n agents. Money transfers are possible and preferences are quasilinear. We offer an explicit description of the individually rational mechanisms which are Pareto-optimal in the class of feasible, strategy-proof, anonymous and envy-free mechanisms. These mechanisms form a one-parameter infinite family; the Vickrey mechanism is the only Groves mechanism in that family.

Pages: 18 pages
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://papyrus.bib.umontreal.ca/xmlui/handle/1866/6204 (application/pdf)

Related works:
Journal Article: Constrained-optimal strategy-proof assignment: Beyond the Groves mechanisms (2013)
Working Paper: Constrained-Optimal Strategy-Proof Assignment: Beyond the Groves Mechanisms (2011)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:mtl:montde:2011-09

Access Statistics for this paper

More papers in Cahiers de recherche from Universite de Montreal, Departement de sciences economiques Contact information at EDIRC.
Bibliographic data for series maintained by Sharon BREWER ().