Nash Social Welfare, Matrix Permanent, and Stable Polynomials

We study the problem of allocating $m$ items to $n$ agents subject to maximizing the Nash social welfare (NSW) objective. We write a novel convex programming relaxation for this problem, and we show that a simple randomized rounding algorithm gives a $1/e$ approximation factor of the objective. Our main technical contribution is an extension of Gurvits's lower bound on the coefficient of the square-free monomial of a degree $m$-homogeneous stable polynomial on $m$ variables to all homogeneous polynomials. We use this extension to analyze the expected welfare of the allocation returned by our randomized rounding algorithm.

[1]  Mohit Singh,et al.  Maximizing determinants under partition constraints , 2016, STOC.

[2]  Sanjeev Khanna,et al.  On Allocating Goods to Maximize Fairness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[3]  Uriel Feige,et al.  Santa Claus Meets Hypergraph Matchings , 2008, APPROX-RANDOM.

[4]  Jörg Rothe,et al.  Computational complexity and approximability of social welfare optimization in multiagent resource allocation , 2012, Autonomous Agents and Multi-Agent Systems.

[5]  Richard Cole,et al.  Approximating the Nash Social Welfare with Indivisible Items , 2018, SIAM J. Comput..

[6]  Ariel D. Procaccia,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.

[7]  Shmuel Friedland,et al.  Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy , 2008, Combinatorics, Probability and Computing.

[8]  Hervé Moulin,et al.  Fair division and collective welfare , 2003 .

[9]  Euiwoong Lee,et al.  APX-hardness of maximizing Nash social welfare with indivisible items , 2015, Inf. Process. Lett..

[10]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[11]  Uriel Feige,et al.  Santa claus meets hypergraph matchings , 2008, TALG.

[12]  Leonid Gurvits,et al.  Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications , 2005, STOC '06.

[13]  Osman Güler,et al.  Hyperbolic Polynomials and Interior Point Methods for Convex Programming , 1997, Math. Oper. Res..

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[15]  Amin Saberi,et al.  An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.

[16]  Nikhil R. Devanur,et al.  Convex Program Duality, Fisher Markets, and Nash Social Welfare , 2016, EC.

[17]  Jörg Rothe,et al.  Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods , 2014, Discret. Appl. Math..

[18]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.