Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.26055 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908619893637120 |
|---|---|
| author | Bebchuk, Alon |
| author_facet | Bebchuk, Alon |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_26055 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | NP-Hardness of Approximating Nash Social Welfare with Supermodular Valuations Bebchuk, Alon Computer Science and Game Theory 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. |
| title | NP-Hardness of Approximating Nash Social Welfare with Supermodular Valuations |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2510.26055 |