On finding an envy-free Pareto-optimal division
- Cite this article as:
- Reijnierse, J.H. & Potters, J.A.M. Mathematical Programming (1998) 83: 291. doi:10.1007/BF02680564
- 128 Views
This paper describes an algorithm to find an (α-)envy-free Pareto-optimal division in the case of a finite number of homogeneous infinitely divisible goods and linear utility functions. It is used to find an allocation in the classical cake division problem that is almost Pareto-optimal and α-envy-free.