{"ID":2847823,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.26055","arxiv_id":"2510.26055","title":"NP-Hardness of Approximating Nash Social Welfare with Supermodular Valuations","abstract":"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.","short_abstract":"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.","url_abs":"https://arxiv.org/abs/2510.26055","url_pdf":"https://arxiv.org/pdf/2510.26055v1","authors":"[\"Alon Bebchuk\"]","published":"2025-10-30T01:14:11Z","proceeding":"cs.GT","tasks":"[\"cs.GT\"]","methods":"[]","has_code":false}