Obvious Manipulations in Cake-Cutting

In cake-cutting, strategy-proofness is a very costly requirement in terms of fairness: for n = 2 it implies a dictatorial allocation, whereas for n ≥ 3 it requires that one agent receives no cake. We show that a weaker version of this property recently suggested by Troyan and Morril, called not-obvious manipulability, is compatible with the strong fairness property of proportionality, which guarantees that each agent receives 1/n of the cake. Both properties are satisfied by the leftmost leaves mechanism, an adaptation of the Dubins - Spanier moving knife procedure. Most other classical proportional mechanisms in literature are obviously manipulable, including the original moving knife mechanism. Not-obvious manipulability explains why leftmost leaves is manipulated less often in practice than other proportional mechanisms.

Ortega, Josué and Erel Segal-Halevi (2019), Obvious Manipulations in Cake-Cutting, ZEW Discussion Paper No. 19-056, Mannheim.