Efficient strategy proof fair allocation algorithms

Akiyoshi Shioura, Ning Sun, Zaifu Yang

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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 languageEnglish
Pages (from-to)144-150
Number of pages7
JournalJournal of the Operations Research Society of Japan
Issue number2
Publication statusPublished - 2006 Jun


  • Economics
  • Efficiency
  • Fairness
  • Indivisibility
  • Polynomial-time algorithms
  • Strategy proof

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research


Dive into the research topics of 'Efficient strategy proof fair allocation algorithms'. Together they form a unique fingerprint.

Cite this