Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/208371 
Year of Publication: 
2019
Series/Report no.: 
ZEW Discussion Papers No. 19-056
Publisher: 
ZEW - Leibniz-Zentrum für Europäische Wirtschaftsforschung, Mannheim
Abstract: 
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.
Subjects: 
cake-cutting
not-obvious manipulability
prior-free mechanism design
JEL: 
D63
D82
Document Type: 
Working Paper

Files in This Item:
File
Size
500.97 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.