Approximating Nash social welfare under rado valuations

DOI10.1145/3406325.3451031arXiv2009.14793OpenAlexW3167898101MaRDI QIDQ6065263

Jugal Garg, László A. Végh, Edin Husić

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.14793

zbMATH Keywords

approximation algorithmNash social welfareRado valuations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (6)

Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds ⋮ An additive approximation scheme for the Nash social welfare maximization with identical additive valuations ⋮ Fair Division of Indivisible Goods for a Class of Concave Valuations ⋮ Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings

This page was built for publication: Approximating Nash social welfare under rado valuations