License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2021.33
URN: urn:nbn:de:0030-drops-136786
URL: https://drops.dagstuhl.de/opus/volltexte/2021/13678/
Go to the corresponding LIPIcs Volume Portal


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

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications

pdf-format:
LIPIcs-STACS-2021-33.pdf (0.9 MB)


Abstract

We consider the Arrow-Debreu exchange market model where agents' demands satisfy the weak gross substitutes (WGS) property. This is a well-studied property, in particular, it gives a sufficient condition for the convergence of the classical tâtonnement dynamics. In this paper, we present a simple auction algorithm that obtains an approximate market equilibrium for WGS demands. Such auction algorithms have been previously known for restricted classes of WGS demands only. As an application of our technique, we obtain an efficient algorithm to find an approximate spending-restricted market equilibrium for WGS demands, a model that has been recently introduced as a continuous relaxation of the Nash social welfare (NSW) problem. This leads to a polynomial-time constant factor approximation algorithm for NSW with budget separable piecewise linear utility functions; only a pseudopolynomial approximation algorithm was known for this setting previously.

BibTeX - Entry

@InProceedings{garg_et_al:LIPIcs.STACS.2021.33,
  author =	{Garg, Jugal and Husi\'{c}, Edin and V\'{e}gh, L\'{a}szl\'{o} A.},
  title =	{{Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications}},
  booktitle =	{38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
  pages =	{33:1--33:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-180-1},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{187},
  editor =	{Bl\"{a}ser, Markus and Monmege, Benjamin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/13678},
  URN =		{urn:nbn:de:0030-drops-136786},
  doi =		{10.4230/LIPIcs.STACS.2021.33},
  annote =	{Keywords: auction algorithm, weak gross substitutes, Fisher equilibrium, Gale equilibrium, Nash social welfare}
}

Keywords: auction algorithm, weak gross substitutes, Fisher equilibrium, Gale equilibrium, Nash social welfare
Collection: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Issue Date: 2021
Date of publication: 10.03.2021


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI