Fairness and efficiency in strategy-proof object allocation mechanisms
@article{Nesterov2017FairnessAE, title={Fairness and efficiency in strategy-proof object allocation mechanisms}, author={Alexander S. Nesterov}, journal={J. Econ. Theory}, year={2017}, volume={170}, pages={145-168} }
I consider the problem of allocating N indivisible objects among N agents according to their preferences when transfers are absent and an outside option may exist. I study the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof mechanisms the following efficiency and fairness criteria are mutually incompatible: (1) ex-post efficiency and envy-freeness, (2) ordinal efficiency and weak envy-freeness, and (3) ordinal… CONTINUE READING
19 Citations
Incompatibility of Efficiency and Strategyproofness in the Random Assignment Setting with Indifferences
- Mathematics, Computer Science
- ArXiv
- 2016
- 1
- PDF
Efficient and fair assignment mechanisms are strongly group manipulable
- Mathematics, Computer Science
- J. Econ. Theory
- 2019
- 3
- Highly Influenced
- PDF
When are efficient and fair assignment mechanisms group strategy-proof?
- Computer Science
- Games Econ. Behav.
- 2020
On the tradeoff between efficiency and strategyproofness
- Mathematics, Computer Science
- Games Econ. Behav.
- 2018
- 15
- PDF
References
SHOWING 1-10 OF 42 REFERENCES
Strategy-proof stochastic assignment
- Economics, Computer Science
- J. Econ. Theory
- 2014
- 53
- Highly Influential
- PDF
Ordinal efficiency and dominated sets of assignments
- Mathematics, Computer Science
- J. Econ. Theory
- 2003
- 82
- PDF
An axiomatic approach to characterizing and relaxing strategyproofness of one-sided matching mechanisms
- Mathematics, Computer Science
- EC
- 2014
- 32
- PDF