Abstract
In this note, we show that a partition of a cake is Pareto optimal if and only if it maximizes some convex combination of the measures used by those who receive the resulting pieces of cake. Also, given any sequence of positive real numbers that sum to one (which may be thought of as representing the players' relative entitlements), we show that there exists a partition in which each player receives either more than, less than, or exactly his or her entitlement (according to his or her measure), in any desired combination, provided that the measures are not all equal.
Similar content being viewed by others
REFERENCES
Barbanel, J.B.: 1996, ‘Super envy-free cake division and independence of measures’, Journal of Mathematical Analysis and Applications 197, 54–60.
Brams, S.J. and Taylor, A.D.: ‘An envy-free cake division protocol’, to appear in the American Mathematical Monthly.
Dubins, L.E. and Spanier, E.H.: 1961, ‘How to cut a cake fairly’, American Mathematical Monthly 68, 1–17.
Dvoretsky, A., Wald, A. and Wolfovitz, J.: 1951, ‘Relations among certain ranges of vector measures’, Pacific Journal of Mathematics 1, 59–74.
Grunbaum B.: 1967, Convex Polytopes, New York: Wiley and Sons.
Lyapounov, A.: 1940, ‘Sur les fonctions-vecteurs completement additives’, Bull. Acad. Sci. URSS 6, 465–478.
Steinhaus, H.: 1948, ‘The problem of fair division’, Econometrica 16, 101–104.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Barbanel, J.B., Zwicker, W.S. Two applications of a theorem of Dvoretsky, Wald, and Wolfovitz to cake division. Theory and Decision 43, 203–207 (1997). https://doi.org/10.1023/A:1004966624893
Issue Date:
DOI: https://doi.org/10.1023/A:1004966624893