Truth, justice, and cake cutting

Yiling Chen, John K. Lai, David C. Parkes and Ariel D. Procaccia

Games and Economic Behavior, 2013, vol. 77, issue 1, 284-297

Abstract: Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of them also take into account self-interested agents and consequent strategic issues, but these papers focus on fairness and consider a strikingly weak notion of truthfulness. In this paper we investigate the problem of cutting a cake in a way that is truthful, Pareto-efficient, and fair, where for the first time our notion of dominant strategy truthfulness is the ubiquitous one in social choice and computer science. We design both deterministic and randomized cake cutting mechanisms that are truthful and fair under different assumptions with respect to the valuation functions of the agents.

Keywords: Fair division; Envy-freeness; Cake cutting; Maximum flows; Strategy-proofness; Mechanism design (search for similar items in EconPapers)
JEL-codes: C78 D63 D82 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825612001571
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:gamebe:v:77:y:2013:i:1:p:284-297

DOI: 10.1016/j.geb.2012.10.009

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().