A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations
A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations
We present a constant-factor approximation algorithm for the Nash social welfare maximization problem with subadditive valuations accessible via demand queries. More generally, we propose a template for NSW optimization by solving a configuration-type LP and using a rounding procedure for (utilitarian) social welfare as a blackbox, which could be applicable to other variants of the problem.
FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), F.2.2, Computer Science and Game Theory (cs.GT)
FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), F.2.2, Computer Science and Game Theory (cs.GT)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!