Envy-Freeness Up to Any Item with High Nash Welfare

This publication has 27 references indexed in Scilit:

• Approximating the Nash Social Welfare with Indivisible Items
  2015
• Characterizing conflicts in fair division of indivisible goods using a scale of criteria
  Autonomous Agents and Multi-Agent Systems, 2015
• Spliddit
  ACM SIGecom Exchanges, 2015
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
  Discrete Applied Mathematics, 2014
• Computational complexity and approximability of social welfare optimization in multiagent resource allocation
  Autonomous Agents and Multi-Agent Systems, 2013
• The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
  Journal of Political Economy, 2011
• The Efficiency of Fair Division
  Theory of Computing Systems, 2011
• The Price of Fairness
  Operations Research, 2011
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
  The Annals of Mathematical Statistics, 1959
• The Bargaining Problem
  Econometrica, 1950