Library Header Image
LSE Research Online LSE Library Services

LP-based covering games with low price of anarchy

Piliouras, Georgios, Valla, Tomáš and Végh, László A. ORCID: 0000-0003-1152-200X (2014) LP-based covering games with low price of anarchy. Theory of Computing Systems, 57 (1). pp. 238-260. ISSN 1432-4350

Full text not available from this repository.

Identification Number: 10.1007/s00224-014-9587-z


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.

Item Type: Article
Official URL:
Additional Information: © 2014 Springer
Divisions: Management
Subjects: H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Q Science > QA Mathematics
Date Deposited: 19 Nov 2014 10:17
Last Modified: 16 May 2024 01:55
Projects: AFOSR project FA9550-09-1-0538, Institute for Theoretical Computer Science project P202/12/G061 of GA ˇ CR, GAUK Project 66010, NSF Grant CCF-0914732
Funders: Air Force Office of Scientific Research, Centre of Excellence – Institute for Theoretical Computer Science, Charles University Prague, National Science Foundation

Actions (login required)

View Item View Item