Constrained allocation problems with single-peaked preferences: An axiomatic analysis
We introduce a new class of problems that contains two existing classes: allocation problems with single-peaked preferences and bankruptcy problems. On this class, we analyze the implications of well-known properties such as Pareto optimality, strategy-proofness, resource-monotonicity, no-envy, equal treatment of equals, and two new properties we introduce, hierarchical no-envy and independence of nonbinding constraints. Unlike earlier literature, we consider rules that allow free-disposability. We present characterizations of a rule we introduce on this domain. We relate this rule to well-known rules on the aforementioned subdomains. Based on this relation, we present a characterization of a well-known bankruptcy rule called the constrained equal awards rule. Copyright Springer-Verlag Berlin Heidelberg 2003
Volume (Year): 20 (2003)
Issue (Month): 3 (06)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:20:y:2003:i:3:p:353-362. 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.