Query complexity of complete envy-free cake division
Determine the worst-case number of Robertson–Webb value and cut queries needed for an exact envy-free allocation of an entire interval among agents with nonatomic additive valuations. Disconnected pieces are allowed.
Inferred from the community field; finer classification has not been reviewed.
Problem statement
Determine the worst-case number of Robertson–Webb value and cut queries needed for an exact envy-free allocation of an entire interval among agents with nonatomic additive valuations. Disconnected pieces are allowed.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Editorial selection inspected on 9 September 2026. Current research status has not been independently reassessed; consult the original source and subsequent literature.
Adapted and reformulated by Frontier Science from the linked Wikipedia list; attribution to Wikipedia contributors is retained under CC BY-SA 4.0. This is a selected formulation, not a full transcription.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.