Equitable cake-cutting

Equitable (EQ) cake-cutting is a kind of a fair cake-cutting problem, in which the fairness criterion is equitability. It is a cake-allocation in which the subjective value of all partners is the same, i.e., each partner is equally happy with his/her share. Mathematically, that means that for all partners $i$ and $j$:


 * $$V_i(X_i) = V_j(X_j)$$

Where: See the page on equitability for examples and comparison to other fairness criteria.
 * $$X_i$$ is the piece of cake allocated to partner $i$;
 * $$V_i$$ is the value measure of partner $i$. It is a real-valued function that, for every piece of cake, returns a number that represents the utility of partner $i$ from that piece. Usually these functions are normalized such that $$V_i(\emptyset)=0$$ and $$V_i(EntireCake)=1$$ for every $i$.

One cut - full revelation
When there are 2 partners, it is possible to get an EQ division with a single cut, but it requires full knowledge of the partners' valuations. Assume that the cake is the interval [0,1]. For each $$x\in[0,1]$$, calculate $$u_1([0,x])$$ and $$u_2([x,1])$$ and plot them on the same graph. Note that the first graph is increasing from 0 to 1 and the second graph is decreasing from 1 to 0, so they have an intersection point. Cutting the cake at that point yields an equitable division. This division has several additional properties:
 * It is EF, since each partner receives a value of at least 1/2.
 * It is not EX, since the value per partner may be more than 1/2.
 * It is Pareto efficient (PE) among all divisions that use a single cut. However, there may be more efficient divisions that use two or more cuts.
 * If the direction of the cake is chosen at random (i.e. it can be flipped such that 0 becomes 1 and 1 becomes 0), then this procedure is also weakly truthful, in the following sense: only by submitting sincere probability measures, can a partner ensure that he receives at least half of the cake.

The same procedure can be used for dividing chores (with negative utility).

Proportional-equitability variant
The full revelation procedure has a variant which satisfies a weaker kind of equitability and a stronger kind of truthfulness. The procedure first finds the median points of each partner. Suppose the median point of partner A is $$a$$ and of partner B is $$b$$, with $$0<a<b<1$$. Then, A receives $$[0,a]$$ and B receives $$[b,1]$$. Now there is a surplus - $$[a,b]$$. The surplus is divided between the partners in equal proportions. So, for example, if A values the surplus as 0.4 and B values the surplus as 0.2, then A will receive twice more value from $$[a,b]$$ than B. So this protocol is not equitable, but it is still EF. It is weakly-truthful in the following sense: a risk-averse player has an incentive to report his true valuation, because reporting an untrue valuation might leave him with a smaller value.

Two cuts - moving knife
Austin moving-knife procedure gives each of the two partners a piece with a subjective value of exactly 1/2. Thus the division is EQ, EX and EF. It requires 2 cuts, and gives one of the partners two disconnected pieces.

Many cuts - full revelation
When more than two cuts are allowed, it is possible to achieve a division which is not only EQ but also EF and PE. Some authors call such a division "perfect".

The minimum number of cuts required for a PE-EF-EQ division depends on the valuations of the partners. In most practical cases (including all cases when the valuations are piecewise-linear) the number of required cuts is finite. In these cases, it is possible to both find the optimal number of cuts and their exact locations. The algorithm requires full knowledge of the partners' valuations.

Run-time
All the above procedures are continuous: the second requires a knife that moves continuously, the others requires a continuous plot of the two value measures. Therefore, they cannot be carried out in a finite number of discrete steps.

This infinity property is characteristic of division problems which require an exact result. See Exact division.

One cut - near-equitable division
A near-equitable division is a division in which the partners' values differ by at most $$\epsilon$$, for any given $$\epsilon>0$$. A near-equitable division for two partners can be found in finite time and with a single cut.

Moving knife procedures
Austin's procedure can be extended to n partners. It gives each partner a piece with a subjective value of exactly $$1/n$$. This division is EQ, but not necessarily EX or EF or PE (since some partners may value the share given to other partners as more than $$1/n$$).

There is another procedure, using n-1 moving knives, that can be used to find a connected equitable allocation for any ordering of the agents.

Connected pieces - full revelation
Jones' full revelation procedure can be extended to $$n$$ partners in the following way:
 * For each of the $$n!$$ possible orderings of the partners, write a set of $$n-1$$ equations in $$n-1$$ variables: the variables are the $$n-1$$ cut-points, and the equations determine the equitability for adjacent partners. For example, of there are 3 partners and the order is A:B:C, then the two variables are $$x_{AB}$$ (the cut-point between A and B) and $$x_{BC}$$, and the two equations are $$V_A(0,x_{AB})=V_B(x_{AB},x_{BC})$$ and $$V_B(x_{AB},x_{BC})=V_C(x_{BC},1)$$. These equations have at least one solution in which all partners have the same value.
 * Out of all $$n!$$ orderings, pick the ordering in which the (equal) value of all partners is the largest.

Note that the maximal equitable value must be at least $$1/n$$, because we already know that a proportional division (giving each partner at least $$1/n$$) is possible.

If the value measures of the partners are absolutely continuous with respect to each other (this means that they have the same support), then any attempt to increase the value of a partner must decrease the value of another partner. This means that the solution is PE among the solutions which give connected pieces.

Impossibility results
Brams, Jones and Klamler study a division which is EQ, PE and EF (they call such a division "perfect").

They first prove that, for 3 partners that must get connected pieces, an EQ+EF division may not exist. They do this by describing 3 specific value measures on a 1-dimensional cake, in which every EQ allocation with 2 cuts is not EF.

Then they prove that, for 3 or more partners, a PE+EF+EQ division may not exist even with disconnected pieces. They do this by describing 3 specific value measures on a 1-dimensional cake, with the following properties:
 * With 2 cuts, every EQ allocation is not EF nor PE (but there are allocations which are EF and 2-PE, or EQ and 2-PE).
 * With 3 cuts, every EQ allocation is not PE (but there is an EQ+EF allocation).
 * With 4 cuts, every EQ allocation is not EF (but there is an EQ+PE allocation).

Pie cutting
A pie is a cake in the shape of a 1-dimensional circle (see fair pie-cutting).

Barbanel, Brams and Stromquist study the existence of divisions of a pie, which are both EQ and EF. The following existence results are proved without providing a specific division algorithm:


 * For 2 partners, there always exists a partition of a pie which is both envy-free and equitable. When the value measures of the partners are absolutely continuous with respect to each other (i.e. every piece which has a positive value for one partner also has a positive value for the other partner), then there exists a partition which is envy-free, equitable and undominated.
 * For 3 or more partners, it may be impossible to find an allocation that is both envy-free and equitable. But there always exists a division that is both equitable and undominated.

Divisible goods
The adjusted winner procedure calculates an equitable, envy-free and efficient division of a set of divisible goods between two partners.

Query complexity
An equitable cake allocation cannot be found using a finite protocol in the Robertson–Webb query model, even for 2 agents. Moreover, for any ε > 0:


 * A connected ε-equitable cake-cutting requires at least Ω(log ε−1) queries. For 2 agents, an O(log ε−1) protocol exists. For 3 or more agents, the best known protocol requires O(n (log n + log ε−1)) queries.
 * Even without connectivity, ε-equitable cake-cutting requires at least Ω(log ε−1 / log log ε−1 ) queries.

Properties of max-equitable allocation rules
The max-equitable division rule is a rule that selects, from among all equitable cake allocations, the one in which the common value of the agents is maximum. It has two variants:


 * The absolute-equitable rule equalizes the absolute (not normalized) values;
 * The relative-equitable rule equalizes the relative (normalized) values.

There always exists a connected max-equitable alloation (both absolute and relative), and it can be found using a generalized moving-knives procedure.


 * The absolute-equitable rule is weakly Pareto-optimal and resource-monotonic, but not proportional.
 * The relative-equitable rule is weakly Pareto-optimal and proportional, but not resource-monotonic.