LP-Based Covering Games with Low Price of Anarchy

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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems 2015-07, Vol.57 (1), p.238-260
Hauptverfasser:	Piliouras, Georgios, Valla, Tomáš, Végh, László A
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Computer Science Costs Efficiency Equilibrium Game theory Linear programming Optimization Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!