%0 Journal Article
%T APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items
%A Euiwoong Lee
%J Computer Science
%D 2015
%I arXiv
%X We study the problem of allocating a set of indivisible items to agents with additive utilities to maximize the Nash social welfare. Cole and Gkatzelis recently proved that this problem admits a constant factor approximation. We complement their result by showing that this problem is APX-hard.
%U http://arxiv.org/abs/1507.01159v1