We study the problem of allocating a set of indivisible items to agents with supermodular utilities to maximize the Nash social welfare. We show that the problem is NP-hard for any approximation factor.

翻译：本文研究在代理人具有超模效用函数的情况下，分配不可分割物品集合以最大化纳什社会福利的问题。我们证明该问题对于任意近似比均为NP难解问题。