On the structure of Pareto optimal cake partitions

Abstract We study Pareto optimal partitions of a “cake” among n players. Each player uses a countably additive non-atomic probability measure to evaluate the size of pieces of cake. We present two geometric pictures appropriate for this study and consider the connection between these pictures and the maximization of convex combinations of measures, which we studied in Barbanel and Zwicker [Barbanel, J.B., Zwicker, W., 1997. Two applications of a theorem of Dvoretsky, Wald, and Wolfovitz to cake division. Theory and Decision 43, 203–207].