This paper studies the problem of fairly allocating an amount of a divisible resource when preferences are single-peaked. We characterize the class of envy-free and peak-only rules and show that the class forms a complete lattice with respect to a dominance relation. We also pin down the subclass of strategy-proof rules and show that the subclass also forms a complete lattice. In both cases, the upper bound is the uniform rule, the lower bound is the equal division rule, and any other rule is between the two.
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.
Publisher Info
Paper provided by Institute of Social and Economic Research, Osaka University in its series ISER Discussion Paper with number
0723.
For technical questions regarding this item, or to correct its listing, contact: (Fumiko Matsumoto).
Related research
Keywords:
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.:
Did you know? You can create a compilation of all publications of a group of people, say alumni of a program, your students or memers of an association.