Abstract
We study a fair division problem with indivisible objects like jobs, houses, and one divisible good like money. Each individual is to be assigned with one object and a certain amount of money. The preferences of individuals over the objects are private information but individuals are assumed to have quasilinear utilities in money. It is shown that there exist efficient algorithms for eliciting honest preferences and assigning the objects with money to individuals efficiently and fairly.
Author supplied keywords
Cite
CITATION STYLE
Shioura, A., Sun, N., & Yang, Z. (2006). Efficient strategy proof fair allocation algorithms. Journal of the Operations Research Society of Japan, 49(2), 144–150. https://doi.org/10.15807/jorsj.49.144
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.