Abstract
Given any problem involving assignment of indivisible objects and a sum of money among individuals, there is an efficient envyfree 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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call