2000 character limit reached
APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items
Published 5 Jul 2015 in cs.CC, cs.DS, and cs.GT | (1507.01159v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.