Monotonicity and the fair assignment solution
Given any problem involving assignment of indivisible objects and a sum of money among individuals, there is a fair assignment (namely the minmax money assignment) which can be extended monotonically to a new fair assignment for any object added or person removed, and another (the maxmin value assignment) extendable similarly for any object removed or person added. This however is the extent of compatibility between fairness and monotonicity axioms in the assignment problem. No allocation other than the minmax money allocation is extendable. An analogue holds for the maxmin value allocation by example.
|Date of creation:||01 Jun 1992|
|Contact details of provider:|| Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)|
Fax: +32 10474304
Web page: http://www.uclouvain.be/core
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:cor:louvco:1992044. 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: (Alain GILLIS)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.