How to share a cake with a secret agent

Guillaume Chèze

Mathematical Social Sciences, 2019, vol. 100, issue C, 13-15

Abstract: In this note we study a problem of fair division in the absence of full information. We give an algorithm that solves the following problem: n≥2 persons want to cut a cake into n shares so that each person will get at least 1∕n of the cake for his or her own measure, furthermore the preferences of one person are secret. How can we construct such shares? Our algorithm is a slight modification of the Even–Paz algorithm and allows to give a connected part to each agent. Moreover, the number of cuts used during the algorithm is optimal: O(nlog(n)).

Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489619300290
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:100:y:2019:i:c:p:13-15

DOI: 10.1016/j.mathsocsci.2019.04.001

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().