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

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.

MoreLess

Year of publication:	2000-02-29
Authors:	Klijn, Flip
Published in:	Social Choice and Welfare. - Springer. - Vol. 17.2000, 2, p. 201-215
Publisher:	Springer

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Type of publication:	Article
Notes:	Received: 22 October 1997/Accepted: 19 January 1999
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005369381