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

[摘要] 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(n log n) cuts are always sufficient. (C) 2019 Elsevier Inc. All rights reserved.

[发布日期] 2019-12-01

[关键词] Fair cake-cutting;Unequal shares;Asymmetric agents;Connected components;Land division