License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.22
URN: urn:nbn:de:0030-drops-75714
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7571/
Go to the corresponding LIPIcs Volume Portal


Roughgarden, Tim ; Talgam-Cohen, Inbal ; Vondrák, Jan

When Are Welfare Guarantees Robust?

pdf-format:
LIPIcs-APPROX-RANDOM-2017-22.pdf (0.8 MB)


Abstract

Computational and economic results suggest that social welfare maximization and combinatorial auction design are much easier when bidders' valuations satisfy the "gross substitutes" condition. The goal of this paper is to evaluate rigorously the folklore belief that the main take-aways from these results remain valid in settings where the gross substitutes condition holds only approximately. We show that for valuations that pointwise approximate a gross substitutes valuation (in fact even a linear valuation), optimal social welfare cannot be approximated to within a subpolynomial factor and demand oracles cannot be simulated using a subexponential number of value queries. We then provide several positive results by imposing additional structure on the valuations (beyond gross substitutes), using a more stringent notion of approximation, and/or using more powerful oracle access to the valuations. For example, we prove that the performance of the greedy algorithm degrades gracefully for near-linear valuations with approximately decreasing marginal values; that with demand queries, approximate welfare guarantees for XOS valuations degrade gracefully for valuations that are pointwise close to XOS; and that the performance of the Kelso-Crawford auction degrades gracefully for valuations that are close to various subclasses of gross substitutes valuations.

BibTeX - Entry

@InProceedings{roughgarden_et_al:LIPIcs:2017:7571,
  author =	{Tim Roughgarden and Inbal Talgam-Cohen and Jan Vondr{\'a}k},
  title =	{{When Are Welfare Guarantees Robustl}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)},
  pages =	{22:1--22:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-044-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{81},
  editor =	{Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7571},
  URN =		{urn:nbn:de:0030-drops-75714},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2017.22},
  annote =	{Keywords: Valuation (set) functions, gross substitutes, linearity, approximation}
}

Keywords: Valuation (set) functions, gross substitutes, linearity, approximation
Seminar: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Issue Date: 2017
Date of publication: 31.07.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI