Fair allocation without trade

Avital Gutman, Noam Nisan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We consider the age-old problem of allocating items among different agents in a way that is efficient and fair. Two papers, by Dolev et al. and Ghodsi et al., have recently studied this problem in the context of computer systems. Both papers had similar models for agent preferences, but advocated different notions of fairness. We formalize both fairness notions in economic terms, extending them to apply to a larger family of utilities. Noting that in settings with such utilities efficiency is easily achieved in multiple ways, we study notions of fairness as criteria for choosing between different efficient allocations. Our technical results are algorithms for finding fair allocations corresponding to two fairness notions: Regarding the notion suggested by Ghodsi et al., we present a polynomial-time algorithm that computes an allocation for a general class of fairness notions, in which their notion is included. For the other, suggested by Dolev et al., we show that a competitive market equilibrium achieves the desired notion of fairness, thereby obtaining a polynomial-time algorithm that computes such a fair allocation and solving the main open problem raised by Dolev et al.
Original languageEnglish
Title of host publicationAAMAS '12
Subtitle of host publicationProceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems
Place of PublicationRichland, SC
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Number of pages10
ISBN (Electronic)9780981738123
StatePublished - Jun 2012


  • Algorithms
  • Economics
  • Performance
  • Fisher Market
  • Fair Allocation
  • Leontief
  • Perfect Complementarity


Dive into the research topics of 'Fair allocation without trade'. Together they form a unique fingerprint.

Cite this