General allocation problems with single-peaked preferences: path-independence and related topics
We face the problem of allocationg a fixed amount of a perfectly divisible good among a group of agents with single-peaked preferences. We survey the three different cases studied in the literature: the pure distribution case, the redistribution case, and the gerneral case. The so called general case provide with a natural framework to analyze the idea of path-independence. In this framework, we explore the existence of rules fulfilling this property. Our first result is negative: a strong version of this property cannot be fulfilled together with efficiency. Nonetheless, some restricted versions of the path-independence property are compatible with interesting properties, in particular no manipulability, and no envy. We then identify two solutions satisfying this sort of property: the equal distance rule, and a new extension of the uniform rule.
Volume (Year): 4 (2002)
Issue (Month): 1 ()
|Contact details of provider:|| Postal: |
Phone: +34 94 6013783
Fax: + 34 94 6013774
Web page: http://link.springer.de/link/service/journals/10108/index.htmEmail:
More information through EDIRC
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:specre:v:4:y:2002:i:1:p:19-40. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.