On finding an envy-free Pareto-optimal division

  title={On finding an envy-free Pareto-optimal division},
  author={Hans Reijnierse and Jos A. M. Potters},
  journal={Math. Program.},
This paper describes an algorithm to find an (a-)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-op timat and o-envy-free. 9 1998 The Mathematical Pregraming, Society, Inc. Published by Elsevier Science B.V_ 
Highly Cited
This paper has 28 citations. REVIEW CITATIONS