Groves sealed bid auctions of heterogeneous objects with fair prices
AbstractWe study the allocation of heterogeneous indivisible objects to agents whose valuations of the objects depend on what other objects they are obtained with. We apply the envyfree criterion to Groves sealed bid auctions, which are value maximizing and dominant strategy incentive compatible for this multi-object allocation problem. First we show that if valuations are unrestricted then there is no Groves auction which ensures that the allocation is always envyfree. We obtain a positive result, however, if the valuations of the objects are superadditive, and give a complete characterization of Groves prices that guarantee envyfreeness for superadditive valuations. Copyright Springer-Verlag Berlin Heidelberg 2003
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Springer in its journal Social Choice and Welfare.
Volume (Year): 20 (2003)
Issue (Month): 3 (06)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Vito Fragnelli & Maria Erminia Marina, 2009. "Strategic Manipulations and Collusions in Knaster Procedure," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 3(2), pages 143-153, July.
- Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2014.
"Egalitarian equivalence and strategyproofness in the queueing problem,"
Springer, vol. 56(2), pages 425-442, June.
- Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Egalitarian Equivalence And Strategyproofness In The Queueing Problem," Discussion Papers in Economics 13/16, Department of Economics, University of Leicester.
- Duygu Yengin, 2012.
"Population Monotonic and Strategy-Proof Mechanisms Respecting Welfare Lower Bounds,"
School of Economics Working Papers
2012-05, University of Adelaide, School of Economics.
- Yengin, Duygu, 2013. "Population monotonic and strategy-proof mechanisms respecting welfare lower bounds," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 389-397.
- Duygu Yengin, 2012.
"Egalitarian-equivalent Groves mechanisms in the allocation of heterogenous objects,"
Social Choice and Welfare, Springer,
Springer, vol. 38(1), pages 137-160, January.
- Duygu Yengin, 2010. "Egalitarian-equivalent Groves Mechanisms in the Allocation of Heterogeneous Objects," School of Economics Working Papers 2010-29, University of Adelaide, School of Economics.
- Shigehiro Serizawa, 2006. "Strategy-Proof and Anonymous Allocation Rules of Indivisible Goods: A New Characterization of Vickrey Allocation Rule," ISER Discussion Paper 0648, Institute of Social and Economic Research, Osaka University.
- Duygu Yengin, 2013.
"Identical Preferences Lower Bound for Allocation of Heterogenous Tasks and NIMBY Problems,"
Journal of Public Economic Theory,
Association for Public Economic Theory, vol. 15(4), pages 580-601, 08.
- Duygu Yengin, 2011. "Identical Preferences Lower Bound for Allocation of Heterogeneous Tasks and NIMBY Problems," School of Economics Working Papers 2011-27, University of Adelaide, School of Economics.
- Duygu Yengin, 2011. "Population Monotonic and Strategy-Proof Mechanisms Respecting Welfare Lower Bounds," School of Economics Working Papers 2011-34, University of Adelaide, School of Economics.
- SPRUMONT, Yves, 2011.
"Constrained-optimal strategy-proof assignment: beyond the Groves mechanisms,"
Cahiers de recherche, Universite de Montreal, Departement de sciences economiques
2011-09, Universite de Montreal, Departement de sciences economiques.
- Sprumont, Yves, 2013. "Constrained-optimal strategy-proof assignment: Beyond the Groves mechanisms," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1102-1121.
- Yves Sprumont, 2011. "Constrained-Optimal Strategy-Proof Assignment: Beyond the Groves Mechanisms," Cahiers de recherche, Centre interuniversitaire de recherche en Ã©conomie quantitative, CIREQ 14-2011, Centre interuniversitaire de recherche en Ã©conomie quantitative, CIREQ.
- Shinji Ohseto, 2006. "Characterizations of strategy-proof and fair mechanisms for allocating indivisible goods," Economic Theory, Springer, vol. 29(1), pages 111-121, September.
- Sven de Vries & James Schummer, 2005.
"On Ascending Vickrey Auctions for Heterogeneous Objects,"
2005 Meeting Papers
389, Society for Economic Dynamics.
- de Vries, Sven & Schummer, James & Vohra, Rakesh V., 2007. "On ascending Vickrey auctions for heterogeneous objects," Journal of Economic Theory, Elsevier, vol. 132(1), pages 95-118, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.