On finding an envy-free Pareto-optimal division
- 147 Downloads
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.
KeywordsEnvy-freeness Pareto-optimality Walras equilibrium
Unable to display preview. Download preview PDF.
- Brams, S., Taylor, A., 1992. An envy free cake division algorithm, Mimeo, Department of Politics, New York University, New York.Google Scholar
- Gale, D., 1960. The theory of linear economic models. McGraw-Hill, New York, pp. 281–287.Google Scholar
- Steinhaus, H., 1948. The problem of fair division. Econometrica 16, 101–104.Google Scholar