An algorithm for envy-free allocations in an economy with indivisible objects and money
- 121 Downloads
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.
KeywordsUtility Function Extreme Point Indivisible Object
Unable to display preview. Download preview PDF.