IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v19y2002i4p723-749.html
   My bibliography  Save this article

Bidding for envy-freeness: A procedural approach to n-player fair-division problems

Author

Listed:
  • Claus-Jochen Haake

    () (Institute of Mathematical Economics, University of Bielefeld, P.O. Box 100131, 33501 Bielefeld, Germany)

  • Matthias G. Raith

    () (Department of Economics, University of Magdeburg, P.O. Box 4120, 39016 Magdeburg, Germany)

  • Francis Edward Su

    () (Department of Mathematics, Harvey Mudd College, Claremont, CA 91711, USA)

Abstract

We 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.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:sochwe:v:19:y:2002:i:4:p:723-749
    Note: Received: 6 March 2000/Accepted: 21 May 2001
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00355/papers/2019004/20190723.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mu'alem, Ahuva, 2014. "Fair by design: Multidimensional envy-free mechanisms," Games and Economic Behavior, Elsevier, vol. 88(C), pages 29-46.
    2. Richard F. Potthoff, 2002. "Use of Linear Programming to Find an Envy-Free Solution Closest to the Brams–Kilgour Gap Solution for the Housemates Problem," Group Decision and Negotiation, Springer, vol. 11(5), pages 405-414, September.
    3. Edith Cohen & Michal Feldman & Amos Fiat & Haim Kaplan & Svetlana Olonetsky, 2010. "Envy-Free Makespan Approximation," Discussion Paper Series dp539, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    4. Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2014. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society, vol. 9(3), September.
    5. Edith Cohen & Michal Feldman & Amos Fiat & Haim Kaplan & Svetlana Olonetsky, 2010. "Truth and Envy in Capacitated Allocation Games," Discussion Paper Series dp540, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    6. Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2014. "Least manipulable Envy-free rules in economies with indivisibilities," Mathematical Social Sciences, Elsevier, vol. 69(C), pages 43-49.
    7. 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.
    8. 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, June.
    9. Johannes Brustle & Jack Dippel & Vishnu V. Narayan & Mashbat Suzuki & Adrian Vetta, 2019. "One Dollar Each Eliminates Envy," Papers 1912.02797, arXiv.org.
    10. 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.
    11. Fragnelli, Vito & Marina, Maria Erminia, 2003. "A fair procedure in insurance," Insurance: Mathematics and Economics, Elsevier, vol. 33(1), pages 75-85, August.
    12. Richard Hule & Matthias Sutter, 2003. "Can the Stability and Growth Pact in EMU Cause Budget Deficit Cycles?," Empirica, Springer;Austrian Institute for Economic Research;Austrian Economic Association, vol. 30(1), pages 25-38, March.
    13. 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.
    14. Ning Sun & Zaifu Yang, 2009. "Strategy Proof And Privacy Preserving Fair Allocation Mechanism," The Japanese Economic Review, Japanese Economic Association, vol. 60(2), pages 143-151, June.
    15. 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.
    16. 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.
    17. Daniela Ambrosino & Vito Fragnelli & Maria Marina, 2006. "Resolving an Insurance Allocation Problem: A Procedural Approach," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 26(3), pages 625-643, June.
    18. 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.
    19. Brams, S. J. & Eldelman, P. H. & Fishburn, P. C., 2000. "Paradoxes of Fair Division," Working Papers 00-13, C.V. Starr Center for Applied Economics, New York University.
    20. Tommy Andersson & Christer Andersson, 2009. "Solving House Allocation Problems with Risk-Averse Agents," Computational Economics, Springer;Society for Computational Economics, vol. 33(4), pages 389-401, May.
    21. 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.
    22. Manurangsi, Pasin & Suksompong, Warut, 2017. "Asymptotic existence of fair divisions for groups," Mathematical Social Sciences, Elsevier, vol. 89(C), pages 100-108.
    23. 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.
    24. ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2012. "(Minimally) 'epsilon'-Incentive Compatible Competitive Equilibria in Economies with Indivisibilities," Cahiers de recherche 2012-03, Universite de Montreal, Departement de sciences economiques.
    25. Ehtamo, Harri & Kettunen, Eero & Hamalainen, Raimo P., 2001. "Searching for joint gains in multi-party negotiations," European Journal of Operational Research, Elsevier, vol. 130(1), pages 54-69, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:19:y:2002:i:4:p:723-749. 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: (Sonal Shukla) or (Springer Nature Abstracting and Indexing). General contact details of provider: http://www.springer.com .

    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.

    We have no references for this item. You can help adding them by using 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.