Double implementation in a market for indivisible goods with a price constraint
I 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.
(This abstract was borrowed from another version of this item.)
If 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.
References listed on IDEAS
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.:
- 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 Abdulkadiroğlu & Tayfun Sönmez & M. Utku Ünver, 2004.
"Room assignment-rent division: A market approach,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 22(3), pages 515-538, 06.
- Steven J. Brams & D. Marc Kilgour, 2001.
"Competitive Fair Division,"
Journal of Political Economy,
University of Chicago Press, vol. 109(2), pages 418-443, April.
- 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.
- Gabrielle Demange & Gale David & Marilda Sotomayor, 1986.
- 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;The Society for Social Choice and Welfare, vol. 19(4), pages 723-749.
- 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.
- 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.
- Tadenuma Koichi & Thomson William, 1995. "Games of Fair Division," Games and Economic Behavior, Elsevier, vol. 9(2), pages 191-204, May.
- Flip Klijn, 2000. "An algorithm for envy-free allocations in an economy with indivisible objects and money," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 17(2), pages 201-215.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:62:y:2008:i:1:p:140-154. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
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.