Name
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. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BF02680564 | Math. Program. |
Keywords | Field | DocType |
Envy-freeness, Pareto-optimality, Walras equilibrium | Discrete mathematics,Mathematical optimization,Finite set,Homogeneous,Polynomial long division,Pareto optimal,Exact division,Euclidean division,Envy-free,Infinite divisibility,Mathematics | Journal |
Volume | Issue | ISSN |
83 | 1-3 | 1436-4646 |
Citations | PageRank | References |
19 | 2.54 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. H. Reijnierse | 1 | 45 | 6.95 |
| J. A. M. Potters | 2 | 67 | 9.76 |