LP-Based Covering Games with Low Price of Anarchy

  • Georgios Piliouras
  • Tomáš Valla
  • László A. Végh
Conference paper

DOI: 10.1007/978-3-642-35311-6_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7695)
Cite this paper as:
Piliouras G., Valla T., Végh L.A. (2012) LP-Based Covering Games with Low Price of Anarchy. In: Goldberg P.W. (eds) Internet and Network Economics. WINE 2012. Lecture Notes in Computer Science, vol 7695. Springer, Berlin, Heidelberg

Abstract

We design a new class of vertex and set cover games, where the price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs. This is in contrast to all previously studied covering games, where the price of anarchy grows linearly with the size of the game. Both the game design and the price of anarchy results are based on structural properties of the linear programming relaxations. For linear costs we also exhibit simple best-response dynamics that converge to Nash equilibria in linear time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Georgios Piliouras
    • 1
  • Tomáš Valla
    • 2
  • László A. Végh
    • 3
  1. 1.School of Electrical & Computer EngineeringGeorgia Institute of TechnologyAtlantaUSA
  2. 2.Faculty of Information TechnologyCzech Technical UniversityPragueCzech Republic
  3. 3.Department of ManagementLondon School of EconomicsLondonUK

Personalised recommendations