Monotonicity and Envyfree Assignments
Given any problem involving assignment of indivisible objects and a sum of money among individuals, there is an efficient envy-free allocation (namely the minmax money allocation) which can be extended monotonically to a new efficient envyfree allocation for any object added or individual removed, and another (the maximin value allocation) extendable similarly for any object removed or person added. Still, the efficient envyfree solution is largely incompatible with the resource and population monotonicity axioms: The minmax money and maxmin value allocations are unique in being extendable.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 4 (1994)
Issue (Month): 4 (May)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:4:y:1994:i:4:p:605-16. 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.