@inproceedings{466b7d1d312d4a51a19c6434c278940d,
title = "A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations",
abstract = "We present a constant-factor approximation algorithm for the Nash Social Welfare (NSW) maximization problem with subadditive valuations accessible via demand queries. More generally, we propose a framework for NSW optimization which assumes two subroutines which (1) solve a configuration-type LP under certain additional conditions, and (2) round the fractional solution with respect to utilitarian social welfare. In particular, a constant-factor approximation for submodular valuations with value queries can also be derived from our framework.",
author = "Shahar Dobzinski and Wenzheng Li and Aviad Rubinstein and Jan Vondr{\'a}k",
note = "Publisher Copyright: {\textcopyright} 2024 Owner/Author.; 56th Annual ACM Symposium on Theory of Computing, STOC 2024 ; Conference date: 24-06-2024 Through 28-06-2024",
year = "2024",
month = jun,
day = "10",
doi = "10.1145/3618260.3649740",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
pages = "467--478",
editor = "Bojan Mohar and Igor Shinkar and Ryan O�Donnell",
booktitle = "STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing",
}