Equitable cake-cutting

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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

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

Text derived from https://en.wikipedia.org/w/index.php?oldid=1375223850 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001375223850 · captured 1789563336.0 · version history

Cite this page as: encyclopegia.org, “Equitable cake-cutting”, snapshot enwiki-001375223850. https://encyclopegia.org/a/equitable-cake-cutting

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.