Cake-cutting with different entitlements: How many cuts are needed?

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


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 2n−2 cuts may be necessary, and O(nlog⁡n) cuts are always sufficient.

Original languageEnglish
Article number123382
JournalJournal of Mathematical Analysis and Applications
Issue number1
StatePublished - 1 Dec 2019


  • Asymmetric agents
  • Connected components
  • Fair cake-cutting
  • Land division
  • Unequal shares


Dive into the research topics of 'Cake-cutting with different entitlements: How many cuts are needed?'. Together they form a unique fingerprint.

Cite this