Obvious manipulations in cake-cutting
Josué Ortega and
No 19-056, ZEW Discussion Papers from ZEW - Leibniz Centre for European Economic Research
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.
Keywords: cake-cutting; not-obvious manipulability; prior-free mechanism design (search for similar items in EconPapers)
JEL-codes: D63 D82 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-des and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:zbw:zewdip:19056
Access Statistics for this paper
More papers in ZEW Discussion Papers from ZEW - Leibniz Centre for European Economic Research Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().