A new fairness notion in the assignment of indivisible resources
- Publisher:
- Elsevier
- Publication Type:
- Journal Article
- Citation:
- Mathematical Social Sciences, 2022, 120, pp. 1-7
- Issue Date:
- 2022-11
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
1-s2.0-S0165489622000622-main.pdf | Published version | 405.81 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
We study the problem of assigning objects. There may be multiple copies of each object. Each agent is assigned at most one. Monetary transfer is not allowed. We require a rule to be fair and efficient. We introduce an axiom that is a natural weakening of no-envy. We call it “bounded no-envy”. It states that for each pair of agents who receive objects of the same rank in their respective preferences, each of them should find his assignment at least as desirable as the other’s. Bounded no-envy is compatible with Pareto efficiency. In particular, the immediate acceptance rules (a.k.a. the “Boston mechanisms”) satisfy both. Our main result is that the immediate acceptance rules are the only rules satisfying weak non-wastefulness, bounded no-envy, rank-respecting invariance, resource monotonicity, and bilateral consistency.
Please use this identifier to cite or link to this item: