TY - BOOK
T1 - Envy-Free Allocations of Indivisible Objects
T2 - An Algorithm and an Application
AU - Klijn, F.
N1 - Pagination: 15
PY - 1997
Y1 - 1997
N2 - 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.As an application, the existence result of envy-free allocations provides a proof of the total balancedness of permutation games.
AB - 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.As an application, the existence result of envy-free allocations provides a proof of the total balancedness of permutation games.
KW - algorithm
KW - welfare economics
M3 - Report
VL - 751
T3 - FEW Research Memorandum
BT - Envy-Free Allocations of Indivisible Objects
PB - Operations research
CY - Tilburg
ER -