Obvious Manipulations in Cake-Cutting
Josue Ortega () and
Papers from arXiv.org
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 > 2 it requires that one agent receives no cake. We show that a weaker version of this property recently suggested by Troyan and Morril, called non-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. Non-obvious manipulability explains why leftmost leaves is manipulated less often in practice than other proportional mechanisms.
Date: 2019-08, Revised 2019-10
New Economics Papers: this item is included in nep-des, nep-gth and nep-mic
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)
http://arxiv.org/pdf/1908.02988 Latest version (application/pdf)
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:arx:papers:1908.02988
Access Statistics for this paper
More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().