We consider the classic cake-division problem when the cake is a heterogeneous good represented by an interval in the real line. We provide a mechanism to implement, in an anonymous way, an envy-free and efficient allocation when agents have private information on their preferences. The mechanism is a multi-step sequential game form in which each agent at each step receives a morsel of the cake that is the intersection of what she asks for herself and what the other agent concedes to her.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 64 (2008) Issue (Month): 1 (September) Pages: 268-289 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
William Thomson, 2004.
"Divide-and-Permute,"
RCER Working Papers
510, University of Rochester - Center for Economic Research (RCER).
[Downloadable!]
Other versions:
Brams, S. J. & Eldelman, P. H. & Fishburn, P. C., 2000.
"Fair Division of Indivisible Items,"
Working Papers
00-15, C.V. Starr Center for Applied Economics, New York University.
[Downloadable!]