Discrete bounded locally proportional cake-cutting protocol for arbitrary graphs with single-exponential query complexity.
A moving -knife solution to the four-person envy-free cake-division problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
Discrete bounded locally proportional cake-cutting protocol for arbitrary graphs with single-exponential query complexity.