The universal upper-bound conjecture for proportional cake-cutting with different entitlements
Statement
Let be a positive integer, let there be value measures on a cake, and let be an entitlement vector. A -proportional allocation assigns each agent a piece whose value according to that agent's measure is at least their entitlement.
Universal upper-bound conjecture. For every , every set of value measures, and every entitlement vector , there exists a -proportional allocation with at most cuts.
The preceding theorem establishes this bound when at least entitlements are equal to for some integer . The conjecture asserts that the same lower bound is always attainable; the simplest case in which it remains open is with entitlements .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.