Double Implementation in a Market for Indivisible Goods with a Price Constraint
I consider the problem of assigning agents to objects where each agent must pay the price of the object he gets and prices must sum to a given number. The objective is to select an assignment-price pair that is envy-free with respect to the true preferences. I prove that the proposed mechanism will implement both in Nash and strong Nash the set of envy-free allocations. The distinguishing feature of the mechanism is that it treats the announced preferences as the true ones and selects an envy-free allocation with respect to the announced preferences.
|Date of creation:||10 Sep 2004|
|Contact details of provider:|| Postal: 08193, Bellaterra, Barcelona|
Phone: 34 93 592 1203
Fax: +34 93 542-1223
Web page: http://pareto.uab.cat
More information through EDIRC
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.:
- 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;The Society for Social Choice and Welfare, vol. 19(4), pages 723-749.
- Svensson, Lars-Gunnar, 1983. "Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness," Econometrica, Econometric Society, vol. 51(4), pages 939-954, 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.
- 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-479, June.
- Tadenuma Koichi & Thomson William, 1995. "Games of Fair Division," Games and Economic Behavior, Elsevier, vol. 9(2), pages 191-204, May.
- Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986.
Journal of Political Economy,
University of Chicago Press, vol. 94(4), pages 863-872, August.
- 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.
- 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.
- Alkan, Ahmet & Demange, Gabrielle & Gale, David, 1991. "Fair Allocation of Indivisible Goods and Criteria of Justice," Econometrica, Econometric Society, vol. 59(4), pages 1023-1039, July.
When requesting a correction, please mention this item's handle: RePEc:aub:autbar:623.04. 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: (Xavier Vila)
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.