Double Implementation in a Market for Indivisible Goods with a Price Constraint
AbstractI consider the problem of assigning agents to indivisible objects, in which each agent pays a price for his object and all prices sum to a given constant. The objective is to select an assignment-price pair that is envy-free with respect to the agents' true preferences. I propose a simple mechanism whereby agents announce valuations for all objects and an envy-free allocation is selected with respect to these announced preferences. I prove that the proposed mechanism implements both in Nash and strong Nash equilibrium the set of true envy-free allocations.
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.
Bibliographic InfoPaper provided by Cardiff University, Cardiff Business School, Economics Section in its series Cardiff Economics Working Papers with number E2005/10.
Length: 22 pages
Date of creation: Dec 2005
Date of revision:
Publication status: Published in Games and Economic Behaviour , 62(1), pp. 140-154, January 2008.
Contact details of provider:
Postal: Aberconway Building, Colum Drive, CARDIFF, CF10 3EU
Phone: +44 (0) 29 20874417
Fax: +44 (0) 29 20874419
Web page: http://business.cardiff.ac.uk/research/academic-sections/economics/working-papers
More information through EDIRC
Indivisible Goods; Envy-Freeness; Implementation; Strong Nash Equilibrium;
Other versions of this item:
- Azacis, Helmuts, 2008. "Double implementation in a market for indivisible goods with a price constraint," Games and Economic Behavior, Elsevier, vol. 62(1), pages 140-154, January.
- Helmuts Azacis, 2004. "Double Implementation in a Market for Indivisible Goods with a Price Constraint," UFAE and IAE Working Papers 623.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy-Making and Implementation
This paper has been announced in the following NEP Reports:
- NEP-ALL-2005-12-20 (All new papers)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Alkan, Ahmet & Demange, Gabrielle & Gale, David, 1991. "Fair Allocation of Indivisible Goods and Criteria of Justice," Econometrica, Econometric Society, vol. 59(4), pages 1023-39, July.
- Svensson, Lars-Gunnar, 1983. "Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness," Econometrica, Econometric Society, vol. 51(4), pages 939-54, July.
- Atila Abdulkadiroglu & Tayfun Sonmez & M. Utku Unver, 2002.
"Room Assignment-Rent Division: A Market Approach,"
Game Theory and Information
0202003, EconWPA, revised 26 Sep 2002.
- Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-72, August.
- Leonard, Herman B, 1983. "Elicitation of Honest Preferences for the Assignment of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 91(3), pages 461-79, June.
- Brams, S.J. & Kilgour, D.M., 1999.
"Competitive Fair Division,"
99-05, C.V. Starr Center for Applied Economics, New York University.
- Claus-Jochen Haake & Matthias G. Raith & Francis Su, 2000.
"Bidding for Envy-Freeness: A Procedural Approach to n-Player Fair Division Problems,"
Claremont Colleges Working Papers
2000-47, Claremont Colleges.
- Claus-Jochen Haake & Matthias G. Raith & Francis Edward Su, 2002. "Bidding for envy-freeness: A procedural approach to n-player fair-division problems," Social Choice and Welfare, Springer, vol. 19(4), pages 723-749.
- Tadenuma Koichi & Thomson William, 1995. "Games of Fair Division," Games and Economic Behavior, Elsevier, vol. 9(2), pages 191-204, May.
- ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010.
"Budget-Balance, Fairness and Minimal Manipulability,"
Cahiers de recherche
18-2010, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- Ehlers, Lars & Svensson, Lars-Gunnar & Andersson, Tommy, 0. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society.
- Andersson, Tommy & Svensson, Lars-Gunnar & Ehlers, Lars, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Working Papers 2010:16, Lund University, Department of Economics, revised 15 Jan 2013.
- ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Cahiers de recherche 2010-09, Universite de Montreal, Departement de sciences economiques.
- Carmen Bevié, 2009. "Manipulation Games in Economics with Indivisible Goods," Working Papers 371, Barcelona Graduate School of Economics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Bruce Webb).
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.