Cake cutting: Explicit examples for impossibility results

Guillaume Chèze

Mathematical Social Sciences, 2019, vol. 102, issue C, 68-72

Abstract: In this article we suggest a model of computation for the cake cutting problem. In this model the mediator can ask the same queries as in the Robertson–Webb model but he or she can only perform algebraic operations as in the Blum–Shub–Smale model. All existing algorithms described in the Robertson–Webb model can be described in this new model.

Keywords: Fair division; Model of computation; Galois theory (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489619300757
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:102:y:2019:i:c:p:68-72

DOI: 10.1016/j.mathsocsci.2019.09.005

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 ().