An algorithm for envy-free allocations in an economy with indivisible objects and money

Flip Klijn

Social Choice and Welfare, 2000, vol. 17, issue 2, 215 pages

Abstract: This 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.

Date: 2000-02-28
Note: Received: 22 October 1997/Accepted: 19 January 1999
References: Add references at CitEc
Citations: View citations in EconPapers (31)

Downloads: (external link)
http://link.springer.de/link/service/journals/00355/papers/0017002/00170201.pdf (application/pdf)
Access to the full text of the articles in this series is restricted

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sochwe:v:17:y:2000:i:2:p:201-215

Ordering information: This journal article can be ordered from
http://www.springer. ... c+theory/journal/355

Access Statistics for this article

Social Choice and Welfare is currently edited by Bhaskar Dutta, Marc Fleurbaey, Elizabeth Maggie Penn and Clemens Puppe

More articles in Social Choice and Welfare from Springer, The Society for Social Choice and Welfare Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().