Probabilistic allocation rules and single-dipped preferences
We consider the problem of allocating an infinitely divisible endowment among a group of agents with single-dipped preferences. A probabilistic allocation rule assigns a probability distribution over the set of possible allocations to every preference profile. We discuss characterizations of the classes of Pareto-optimal and strategy-proof probabilistic rules which satisfy in addition replacement-domination or no-envy. Interestingly, these results also apply to problems of allocating finitely many identical indivisible objects - to probabilistic and to deterministic allocation.
Volume (Year): 19 (2002)
Issue (Month): 2 ()
|Note:||Received: 23 November 1998/Accepted: 20 October 2000|
|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:19:y:2002:i:2:p:325-348. 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.