Uniform Welfare Guarantees Under Identical Subadditive Valuations

Abstract

We study the problem of allocating indivisible goods among agents that have an identical subadditive valuation over the goods. The extent of fair- ness and efficiency of allocations is measured by the generalized means of the values that the alloca- tions generate among the agents. Parameterized by an exponent term p, generalized-mean welfares en- compass multiple well-studied objectives, such as social welfare, Nash social welfare, and egalitarian welfare. We establish that, under identical subadditive valu- ations and in the demand oracle model, one can efficiently find a single allocation that approximates the optimal generalized-mean welfare—to within a factor of 40—uniformly for all p ∈ (−∞,1]. Hence, by way of a constant-factor approximation algorithm, we obtain novel results for maximizing Nash social welfare and egalitarian welfare for identical subadditive valuations.

Cite

Text

Barman and Sundaram. "Uniform Welfare Guarantees Under Identical Subadditive Valuations." International Joint Conference on Artificial Intelligence, 2020. doi:10.24963/IJCAI.2020/7

Markdown

[Barman and Sundaram. "Uniform Welfare Guarantees Under Identical Subadditive Valuations." International Joint Conference on Artificial Intelligence, 2020.](https://mlanthology.org/ijcai/2020/barman2020ijcai-uniform/) doi:10.24963/IJCAI.2020/7

BibTeX

@inproceedings{barman2020ijcai-uniform,
  title     = {{Uniform Welfare Guarantees Under Identical Subadditive Valuations}},
  author    = {Barman, Siddharth and Sundaram, Ranjani G.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2020},
  pages     = {46-52},
  doi       = {10.24963/IJCAI.2020/7},
  url       = {https://mlanthology.org/ijcai/2020/barman2020ijcai-uniform/}
}