Cake-Cutting with Different Entitlements: How Many Cuts are Needed?
share
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, we show that at least 2 n -2 cuts may be necessary, and 2 n·Θ((n)) cuts are always sufficient.
READ FULL TEXT