On finding an envy-free Pareto-optimal division

On finding an envy-free Pareto-optimal division

0.00 Avg rating0 Votes
Article ID: iaor20001138
Country: Netherlands
Volume: 83
Issue: 2
Start Page Number: 291
End Page Number: 311
Publication Date: Oct 1998
Journal: Mathematical Programming
Authors: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.