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.
Original language | English |
---|---|
Pages (from-to) | 144-150 |
Number of pages | 7 |
Journal | Journal of the Operations Research Society of Japan |
Volume | 49 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2006 Jun |
Keywords
- Economics
- Efficiency
- Fairness
- Indivisibility
- Polynomial-time algorithms
- Strategy proof
ASJC Scopus subject areas
- Decision Sciences(all)
- Management Science and Operations Research