Fetching the paper…
Reading the bibliography…
We study the problem of allocating $m$ items to $n$ agents subject to maximizing the Nash social welfare (NSW) objective.
Hyperbolic polynomials and interior point methods for convex programming
Osman Güler · 1997
Earlier work this paper cites.
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Mark Jerrum, Alistair Sinclair, and Eric Vigoda · 2004
Earlier work this paper cites.
Fair division and collective welfare
Hervé Moulin · 2004
Earlier work this paper cites.
The santa claus problem
N Bansal and M Sviridenko · 2006
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2006
Earlier work this paper cites.
Hyperbolic polynomials approach to van der waerden/schrijver-valiant like conjectures: Sharper bounds, simpler proofs and algorithmic applications
Leonid Gurvits · 2006
Earlier work this paper cites.
An approximation algorithm for max-min fair allocation of indivisible goods
Arash Asadpour and Amin Saberi · 2007
Cited alongside, same era.
Santa claus meets hypergraph matchings
Arash Asadpour, Uriel Feige, and Amin Saberi · 2008
Cited alongside, same era.
On allocating goods to maximize fairness
Deeparnab Chakrabarty, Julia Chuzhoy, and Sanjeev Khanna · 2009
Cited alongside, same era.
Computational complexity and approximability of social welfare optimization in multiagent resource allocation
Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, and Jörg Rothe · 2014
Cited alongside, same era.
Minimizing envy and maximizing average nash social welfare in the allocation of indivisible goods
Trung Thanh Nguyen and Jörg Rothe · 2014
Cited alongside, same era.
Approximating the nash social welfare with indivisible items
Richard Cole and Vasilis Gkatzelis · 2015
Later among the works it cites.
Apx-hardness of maximizing nash social welfare with indivisible items
Euiwoong Lee · 2015
Later among the works it cites.
Convex program duality, fisher markets, and nash social welfare
Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, and Sadra Yazdanbod · 2016
Closest in time.
The unreasonable fairness of maximum nash welfare
Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang · 2016
Closest in time.
Maximizing determinants under partition constraints
Aleksandar Nikolov and Mohit Singh · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…