A proportional cake-cutting is a kind of fair cake-cutting. It is a division of a heterogeneous resource ("cake") that satisfies the proportionality criterion...

Fair cake-cutting is a kind of fair division problem. The problem involves a heterogeneous resource, such as a cake with different toppings, that is assumed...

resource by their own valuation. In contrast, in the simpler proportional cake-cutting setting, the weights are equal: w i = 1 / n {\displaystyle w_{i}=1/n}...

envy-free cake-cutting, there is a cake modeled as an interval, and n {\displaystyle n} agents with different value measures over the cake. The value...

then the fairness criteria should be adapted accordingly. See proportional cake-cutting with different entitlements. In addition to fairness, it is sometimes...

An envy-free cake-cutting is a kind of fair cake-cutting. It is a division of a heterogeneous resource ("cake") that satisfies the envy-free criterion...

The fair pie-cutting problem is a variation of the fair cake-cutting problem, in which the resource to be divided is circular. As an example, consider...

of its parts. Hence, proportional division is usually studied in the context of fair cake-cutting. See proportional cake-cutting for detailed information...

Efficient cake-cutting is a problem in economics and computer science. It involves a heterogeneous resource, such as a cake with different toppings or...

problem of fair cake-cutting. In this problem, there is a resource called a "cake", and several agents with different value measures on the cake. The goal is...

"Mathematical Games column" in Scientific American. See also proportional cake-cutting. A newer method was reported in Scientific American. It was developed...

Egalitarian cake-cutting is a kind of fair cake-cutting in which the fairness criterion is the egalitarian rule. The cake represents a continuous resource...

garment rule. Fair cake-cutting is the problem of dividing a heterogeneous continuous resource. There always exists a proportional cake-cutting respecting the...

Symmetric fair cake-cutting is a variant of the fair cake-cutting problem, in which fairness is applied not only to the final outcome, but also to the...

Truthful cake-cutting is the study of algorithms for fair cake-cutting that are also truthful mechanisms, i.e., they incentivize the participants to reveal...

computationally-efficient algorithm for fair cake-cutting. It involves a certain heterogeneous and divisible resource, such as a birthday cake, and n partners with different...

earned or loss incurred Fair division Entitlement (fair division) Proportional cake-cutting with different entitlements "legislative apportionment | government...

"larger" in cake-cutting and "smaller" in chore-cutting. However, not all results are so easy to translate. The definition of proportional division in...

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...

for fair cake-cutting. In the problem of cake-cutting among families, there are n agents grouped into k families; the goal is to partition a cake into k...

a bound of: 8-4*√3 ≅ 1.07. When the entire cake is divided, an envy-free division is always proportional. Hence the lower bound on the worst-case UPOP...

procedure is a procedure for proportional cake-cutting. It involves a heterogenous and divisible resource, such as a birthday cake, and n partners with different...

Utilitarian cake-cutting (also called maxsum cake-cutting) is a rule for dividing a heterogeneous resource, such as a cake or a land-estate, among several...

preferences over different parts of the cake. It allows the n people to achieve a proportional division, i.e., divide the cake among them such that each person...

1948, Hugo Steinhaus conjectured the existence of a super-proportional division of a cake: It may be stated incidentally that if there are two (or more)...

and more. Cheze shows a polynomial-time algorithm for connected proportional cake-cutting among any number of agents, when there is a single secretive agent...

is described in the page state-population monotonicity. In the fair cake-cutting problem, classic allocation rules such as divide and choose are not PM...

known as Successive Pairs or Lone Chooser) is a protocol for proportional division of a cake. Its main advantage is that it can work in an online fashion...

to give proportional representation of different interests. Brams was a co-discoverer, with Alan Taylor, of the first envy-free cake-cutting solution...

This is in contrast to proportional division procedures, which give each partner at least 1 / n {\displaystyle 1/n} of the cake, but may give more to some...