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.
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): 19 (2002)
Issue (Month): 2 ()
|Note:||Received: 23 November 1998/Accepted: 20 October 2000|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/355|