Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings

DOI10.1137/1.9781611975994.163OpenAlexW3001493365MaRDI QIDQ5146959

Pooja Kulkarni, Jugal Garg, Rucha Kulkarni

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (10)

Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ Maximum Nash welfare and other stories about EFX ⋮ On the existence of EFX allocations ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ Fair Division of Indivisible Goods for a Class of Concave Valuations ⋮ EFX under budget constraint ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ Unnamed Item ⋮ Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings ⋮ Nash Social Welfare Approximation for Strategic Agents

This page was built for publication: Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings