Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cake-Cutting with Different Entitlements: How Many Cuts are Needed?

Published 14 Mar 2018 in math.CO and cs.GT | (1803.05470v3)

Abstract: A cake has to be divided fairly among $n$ agents. When all agents have equal entitlements, it is known that such a division can be implemented with $n-1$ cuts. When agents may have different entitlements, the paper shows that at least $2 n -2$ cuts may be necessary, and $O(n \log(n))$ cuts are always sufficient.

Citations (24)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Erel Segal-Halevi 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up