We consider allocation problems with indivisible goods when agents’ preferences are single-peaked. Two natural procedures (up methods and temporary satisfaction methods) are proposed to solve these problems. They are constructed by using priority methods on the cartesian product of agents and integer numbers, interpreted either as peaks or opposite peaks. Thus, two families of solutions arise this way. Our two families of solutions satisfy properties very much related to some well-known properties studied in the case of perfectly divisible goods, and they have a strong relationship with the continuous uniform and equal-distance rules, respectively.
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
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie) in its series Working Papers. Serie AD with number
2006-14.
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.:
Salvador Barbera, 1995.
"Strategy-Proof Allotment Rules,"
Discussion Papers
1142, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
[Downloadable!]
Cited by: (explanations, 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.)