Bidding for Envy-Freeness: A Procedural Approach to n-Player Fair Division Problems
AbstractWe develop a procedure for implementing an efficient and envy-free allocation of m objects among n individuals with the possibility of monetary side-payments, assuming that players have quasi-linear utility functions. The procedure eliminates envy by compensating envious players. It is fully descriptive and says explicitly which compensations should be made, and in what order. Moreover, it is simple enough to be carried out without computer support. We formally characterize the properties of the procedure, show how it establishes envy-freeness with minimal resources, and demonstrate its application to a wide class of fair-division problems.
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 Claremont Colleges in its series Claremont Colleges Working Papers with number 2000-47.
Date of creation: 2000
Date of revision:
Contact details of provider:
Postal: 500 E. 9th Street, Claremont, CA 91711
Phone: (909) 607-3041
Fax: (909) 621-8249
Web page: http://www.claremontmckenna.edu/rdschool/papers/
More information through EDIRC
Other versions of this item:
- 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.
- NEP-ALL-2001-07-13 (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.:
- Flip Klijn, 2000. "An algorithm for envy-free allocations in an economy with indivisible objects and money," Social Choice and Welfare, Springer, vol. 17(2), pages 201-215.
- 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.
- 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.
- 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.
- Francis Su, . "Rental Harmony: Sperner's Lemma in Fair Division," Claremont Colleges Working Papers 1999-10, Claremont Colleges.
- Andersson, Tommy & Svensson, Lars-Gunnar & Ehlers, Lars, 2010.
"Budget-Balance, Fairness and Minimal Manipulability,"
2010:16, Lund University, Department of Economics, revised 15 Jan 2013.
- Ehlers, Lars & Svensson, Lars-Gunnar & Andersson, Tommy, 0. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society.
- 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.
- 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.
- 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.
- Azacis, Helmuts, 2005. "Double Implementation in a Market for Indivisible Goods with a Price Constraint," Cardiff Economics Working Papers E2005/10, Cardiff University, Cardiff Business School, Economics Section.
- 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).
- Tommy ANDERSSON & Lars EHLERS, 2013.
"An Algorithm for Identifying Agent-k-Linked Allocations in Economies with Indivisibilities,"
Cahiers de recherche
17-2013, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- ANDERSSON, Tommy & EHLERS, Lars, 2013. "An algorithm for identifying agent-k-linked allocations in economies with indivisibilities," Cahiers de recherche 2013-12, Universite de Montreal, Departement de sciences economiques.
- Tommy Andersson & Christer Andersson, 2009. "Solving House Allocation Problems with Risk-Averse Agents," Computational Economics, Society for Computational Economics, vol. 33(4), pages 389-401, May.
- 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, vol. 3(2), pages 143-153, July.
- Edith Cohen & Michal Feldman & Amos Fiat & Haim Kaplan & Svetlana Olonetsky, 2010. "Envy-Free Makespan Approximation," Discussion Paper Series dp539, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Daniela Ambrosino & Vito Fragnelli & Maria Marina, 2006. "Resolving an Insurance Allocation Problem: A Procedural Approach," Social Choice and Welfare, Springer, vol. 26(3), pages 625-643, June.
- Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2012. "Least Manipulable Envy-free Rules in Economies with Indivisibilities," Working Papers 2012:8, Lund University, Department of Economics, revised 30 Sep 2013.
- Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506 Elsevier.
- Tommy Andersson & Lars Ehlers & Lars-Gunnar Svensson, 2012. "(Minimally) ?-Incentive Compatible Competitive Equilibria in Economies with Indivisibilities," Cahiers de recherche 04-2012, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- Richard Hule & Matthias Sutter, 2003. "Can the Stability and Growth Pact in EMU Cause Budget Deficit Cycles?," Empirica, Springer, vol. 30(1), pages 25-38, March.
- Simmons, Forest W. & Su, Francis Edward, 2003. "Consensus-halving via theorems of Borsuk-Ulam and Tucker," Mathematical Social Sciences, Elsevier, vol. 45(1), pages 15-25, February.
- Clark Bowman & Jonathan Hodge & Ada Yu, 2014. "The potential of iterative voting to solve the separability problem in referendum elections," Theory and Decision, Springer, vol. 77(1), pages 111-124, June.
- Edith Cohen & Michal Feldman & Amos Fiat & Haim Kaplan & Svetlana Olonetsky, 2010. "Truth and Envy in Capacitated Allocation Games," Discussion Paper Series dp540, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Andersson, T. & Svensson, L.-G. & Yang, Z., 2010. "Constrainedly fair job assignments under minimum wages," Games and Economic Behavior, Elsevier, vol. 68(2), pages 428-442, March.
- Fragnelli, Vito & Marina, Maria Erminia, 2003. "A fair procedure in insurance," Insurance: Mathematics and Economics, Elsevier, vol. 33(1), pages 75-85, August.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
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.