An algorithm for envy-free allocations in an economy with indivisible objects and money
AbstractThis paper studies envy-free allocations for economies with indivisible objects, quasi-linear utility functions, and an amount of money. We give a polynomially bounded algorithm for finding envy-free allocations. Connectedness of envy-graphs, which are used in the algorithm, characterizes the extreme points of the polytopes of sidepayments corresponding with 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.
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.
Bibliographic InfoArticle provided by Springer in its journal Social Choice and Welfare.
Volume (Year): 17 (2000)
Issue (Month): 2 ()
Note: Received: 22 October 1997/Accepted: 19 January 1999
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- 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.
- Klijn, F. & Tijs, S.H. & Hamers, H.J.M., 1999.
"Balancedness of Permutation Games and Envy-Free Allocations in Indivisible Good Economies,"
1999-21, Tilburg University, Center for Economic Research.
- Klijn, Flip & Tijs, Stef & Hamers, Herbert, 2000. "Balancedness of permutation games and envy-free allocations in indivisible good economies," Economics Letters, Elsevier, vol. 69(3), pages 323-326, December.
- Klijn, F. & Tijs, S.H. & Hamers, H.J.M., 2000. "Balancedness of permutation games and envy-free allocations in indivisible good economies," Open Access publications from Tilburg University urn:nbn:nl:ui:12-84001, Tilburg University.
- 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 & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Cahiers de recherche 2010-09, Universite de Montreal, Departement de sciences economiques.
- 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.
- Onur Kesten & Ayşe Yazıcı, 2012. "The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods," Economic Theory, Springer, vol. 50(2), pages 463-488, June.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- Claus-Jochen Haake & Matthias G. Raith & Francis Edward Su, 1999. "Bidding for envy-freeness: A procedural approach to n-player fair-division problems," Working Papers 311, Bielefeld University, Center for Mathematical Economics.
- Meertens, Marc & Potters, Jos & Reijnierse, Hans, 2002. "Envy-free and Pareto efficient allocations in economies with indivisible goods and money," Mathematical Social Sciences, Elsevier, vol. 44(3), pages 223-233, December.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
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.