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.
If you experience problems downloading a file, check if you have the proper application to view it first. 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): 4 (2002)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.springer.com|
Postal:Universidad del País Vasco; DFAE II; Avenida Lehendakari Aguirre, 83; 48015 Bilbao; Spain
Phone: +34 94 6013783
Fax: + 34 94 6013774
Web page: http://spaneconrev.org/
More information through EDIRC
|Order Information:||Web: http://www.springer.com/economics/journal/10108?detailsPage=societies|