Proceedings Abstracts of the Twenty-Fourth International Joint Conference on Artificial Intelligence

A Dictatorship Theorem for Cake Cutting / 482
Simina Brânzei, Peter Bro Miltersen

We consider discrete protocols for the classical Steinhaus cake cutting problem. Under mild technical conditions, we show that any deterministic strategy-proof protocol for two agents in the standard Robertson-Webb query model is dictatorial, that is, there is a fixed agent to which the protocol allocates the entire cake. For n > 2 agents, a similar impossibility holds, namely there always exists an agent that gets the empty piece (i.e. no cake). In contrast, we exhibit randomized protocols that are truthful in expectation and compute approximately fair allocations.