NICI > Publications > 1998 > On finding an envy-free Pareto optimal division
|
|
Reference
Reijnierse, J.H., & Potters, J.A.M. (1998). On finding an envy-free Pareto optimal division. Mathematical Programming, 83 (2), 291-311.
Abstract
An algorithm to find an alpha-envy free Pareto optimal allocation in the case of an economy with infinitely divisible goods and linear utility functions is the main result of this paper. It is used to find an allocation in the classical cake division problem that is almost Pareto optimal and alpha-envy free.