Utilitarian cake-cutting

Consider a cake with two parts: chocolate and vanilla, and two partners: Alice and George, with the following valuations: The utilitarian rule gives each part to the partner with the highest utility. In this case, the utilitarian rule gives the entire chocolate to Alice and the entire Vanilla to George. The maxsum is 13. The utilitarian division is not fair: it is not proportional since George receives less than half the total cake value, and it is not envy-free since George envies Alice. == Notation ==

The cake is called C. It is usually assumed to be either a finite 1-dimensional segment, a 2-dimensional polygon or a finite subset of the multidimensional Euclidean plane \mathbb{R}^d. There are n partners. Each partner i has a personal value function V_i which maps subsets of C ("pieces") to numbers. C has to be divided to n disjoint pieces, one piece per partner. The piece allocated to partner i is called X_i, and C = X_1 \sqcup ... \sqcup X_n. A division X is called utilitarian or utilitarian-maximal or maxsum if it maximizes the following expression: :\sum_{i=1}^{n}{V_i(X_i)} The concept is often generalized by assigning a different weight to each partner. A division X is called weighted-utilitarian-maximal (WUM) if it maximizes the following expression: :\sum_{i=1}^{n}\frac{V_i(X_i)}{w_i} where the w_i are given positive constants. == Maxsum and Pareto-efficiency ==

Every WUM division with positive weights is obviously Pareto-efficient. This is because, if a division Y Pareto-dominates a division X, then the weighted sum-of-utilities in Y is strictly larger than in X, so X cannot be a WUM division. What's more surprising is that every Pareto-efficient division is WUM for some selection of weights. == Characterization of the utilitarian rule ==

Christopher P. Chambers suggests a characterization to the WUM rule. The characterization is based on the following properties of a division rule R: • Pareto-efficiency (PE): the rule R returns only divisions which are Pareto-efficient. • Division independence (DI): whenever a cake is partitioned to several sub-cakes and each cake is divided according to rule R, the result is the same as if the original cake were partitioned according to R. • Independence of infeasible land (IIL): whenever a sub-cake is divided according to R, the result does not depend on the utilities of the partners in the other sub-cakes. • Positive treatment of equals (PTE): whenever all partners have the same utility function, R recommends at least one division that gives a positive utility to each partner. • Scale-invariance (SI): whenever the utility functions of the partners are multiplied by constants (a possibly different constant to each partner), the recommendations given by R do not change. • Continuity (CO): for a fixed piece of cake, the set of utility profiles which map to a specific allocation is a closed set under pointwise convergence. The following is proved for partners that assign positive utility to every piece of cake with positive size: • If R is PE DI and IIL, then there exists a sequence of weights w_1,\dots,w_n such that all divisions recommended by R are WUM with these weights (it is known that every PE division is WUM with some weights; the news are that all divisions recommended by R are WUM with the same weights. This follows from the DI property). • If R is PE DI IIL and PTE, then all divisions recommended by R are utilitarian-maximal (in other words, all divisions must be WUM and all agents must have equal weights. This follows from the PTE property). • If R is PE DI IIL and SI, then R is a dictatorial rule - it gives the entire cake to a single partner. • If R is PE DI IIL and CO, then there exists a sequence of weights w_1,\dots,w_n such that R is a WUM rule with these weights (i.e. R recommends all and only WUM divisions with these weights). == Finding utilitarian divisions ==

Disconnected pieces When the value functions are additive, maxsum divisions always exist. Intuitively, we can give each fraction of the cake to the partner that values it the most, as in the example above. Similarly, WUM divisions can be found by giving each fraction of the cake to the partner for whom the ratio V_i / w_i is largest. This process is easy to carry out when cake is piecewise-homogeneous, i.e., the cake can be divided to a finite number of pieces such that the value-density of each piece is constant for all partners. When the cake is not piecewise-homogeneous, the above algorithm does not work since there is an infinite number of different "pieces" to consider. Maxsum divisions still exist. This is a corollary of the Dubins–Spanier compactness theorem and it can also be proved using the Radon–Nikodym set. However, no finite algorithm can find a maxsum division. Proof: A finite algorithm has value-data only about a finite number of pieces. I.e. there is only a finite number of subsets of the cake, for which the algorithm knows the valuations of the partners. Suppose the algorithm has stopped after having value-data about k subsets. Now, it may be the case that all partners answered all the queries as if they have the same value measure. In this case, the largest possible utilitarian value that the algorithm can achieve is 1. However, it is possible that deep inside one of the k pieces, there is a subset which two partners value differently. In this case, there exists a super-proportional division, in which each partner receives a value of more than 1/n, so the sum of utilities is strictly more than 1. Hence, the division returned by the finite algorithm is not maxsum. Connected pieces When the cake is 1-dimensional and the pieces must be connected, the simple algorithm of assigning each piece to the agent that values it the most no longer works, even with piecewise-constant valuations. In this case, the problem of finding a UM division is NP-hard, and furthermore no FPTAS is possible unless P=NP. There is an 8-factor approximation algorithm, and a fixed-parameter tractable algorithm which is exponential in the number of players.{{cite conference|last1=Aumann|first1=Yonatan|last2=Dombb|first2=Yair|last3=Hassidim|first3=Avinatan|title=Computing Socially-Efficient Cake Divisions For every set of positive weights, a WUM division exists and can be found in a similar way. == Maxsum and fairness ==

A maxsum division is not always fair; see the example above. Similarly, a fair division is not always maxsum. One approach to this conflict is to bound the "price of fairness" - calculate upper and lower bounds on the amount of decrease in the sum of utilities, that is required for fairness. For more details, see price of fairness. Another approach to combining efficiency and fairness is to find, among all possible fair divisions, a fair division with a highest sum-of-utilities: Finding utilitarian-fair allocations The following algorithms can be used to find an envy-free cake-cutting with maximum sum-of-utilities, for a cake which is a 1-dimensional interval, when each person may receive disconnected pieces and the value functions are additive: • For n partners with piecewise-constant valuations: divide the cake into m totally-constant regions. Solve a linear program with nm variables: each (agent, region) pair has a variable that determines the fraction of the region given to the agent. For each region, there is a constraint saying that the sum of all fractions from this region is 1; for each (agent, agent) pair, there is a constraint saying that the first agent does not envy the second one. Note that the allocation produced by this procedure might be highly fractioned. • For 2 partners with piecewise-linear valuations: for each point in the cake, calculate the ratio between the utilities: r=u_1/u_2. Give partner 1 the points with r\geq r^* and partner 2 the points with r, where r^* is a threshold calculated so that the division is envy-free. In general r^* cannot be calculated because it might be irrational, but in practice, when the valuations are piecewise-linear, r^* can be approximated by an "irrational search" approximation algorithm. For any \epsilon > 0, The algorithm find an allocation that is \epsilon-EF (the value of each agent is at least the value of each other agent minus \epsilon), and attains a sum that is at least the maximum sum of an EF allocation. Its run-time is polynomial in the input and in \log(1/\epsilon). • For n partners with general valuations: additive approximation to envy and efficiency, based on the piecewise-constant-valuations algorithm. Properties of utilitarian-fair allocations Brams, Feldman, Lai, Morgenstern and Procaccia study both envy-free (EF) and equitable (EQ) cake divisions, and relate them to maxsum and Pareto-optimality (PO). As explained above, maxsum allocations are always PO. However, when maxsum is constrained by fairness, this is not necessarily true. They prove the following: • When there are two agents, maxsum-EF, maximum-EQ and maximum-EF-EQ allocations are always PO. • When there are three or more agents with piecewise-uniform valuations, maxsum-EF allocations are always PO (since EF is equivalent to proportionality, which is preserved under Pareto improvements). However, there may be no maxsum-EQ and maxsum-EQ-EF allocations that are PO. • When there are three or more agents with piecewise-constant valuations, there may be even no maxsum-EF allocations that are PO. For example, consider a cake with three regions and three agents with values: : The maxsum rule gives region i to agent i, but it is not EF since Carl envies Alice. Using a linear program, it is possible to find the unique maxsum-EF allocation, and show that it must share both region 1 and region 2 between Alice and Bob. However, such allocation cannot be PO since Alice and Bob could both gain by swapping their shares in these regions. • When all agents have piecewise-linear valuations, the utility-sum of a maxsum-EF allocation is at least as large as a maxsum-EQ allocation. This result extends to general valuations up to an additive approximation (i.e., -EF allocations have a utility-sum of at least EQ allocations − ). == Monotonicity properties of utilitarian cake-cutting ==

When the pieces may be disconnected, the absolute-utilitarian rule (maximizing the sum of non-normalized utilities) is resource-monotonic and population-monotonic. The relative-utilitarian rule (maximizing the sum of normalized utilities) is population-monotonic but not resource-monotonic. This no longer holds when the pieces are connected. == See also ==