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

[1]  Christos H. Papadimitriou,et al.  On Learning Algorithms for Nash Equilibria , 2010, SAGT.

[2]  Fabrizio Grandoni,et al.  Distributed Weighted Vertex Cover via Maximal Matchings , 2005, COCOON.

[3]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[4]  Nicole Immorlica,et al.  Limitations of cross-monotonic cost sharing schemes , 2005, SODA '05.

[5]  Christos Koufogiannakis,et al.  Distributed and parallel algorithms for weighted vertex cover and other covering problems , 2009, PODC '09.

[6]  Satoru Iwata,et al.  A push-relabel framework for submodular function minimization and applications to parametric optimization , 2003, Discret. Appl. Math..

[7]  Martin Hoefer.  Competitive Cost Sharing with Economies of Scale , 2009, Algorithmica.

[8]  Joseph Naor,et al.  Non-Cooperative Cost Sharing Games via Subsidies , 2010, Theory of Computing Systems.

[9]  Éva Tardos,et al.  Beyond the Nash Equilibrium Barrier , 2011, ICS.

[10]  Éva Tardos,et al.  Load balancing without regret in the bulletin board model , 2009, PODC '09.

[11]  Éva Tardos,et al.  Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract , 2009, STOC '09.

[12]  Tim Roughgarden,et al.  Local smoothness and the price of anarchy in atomic splittable congestion games , 2011, SODA '11.

[13]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[14]  Shaojie Tang,et al.  Mechanism design for set cover games with selfish element agents , 2010, Theor. Comput. Sci..

[15]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[16]  Joseph Naor,et al.  Non-Cooperative Cost Sharing Games via Subsidies , 2009, Theory of Computing Systems.

[17]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[18]  Britta Peis,et al.  Resource Buying Games , 2014, Algorithmica.

[19]  Maria-Florina Balcan,et al.  Minimally invasive mechanism design: Distributed covering with carefully chosen advice , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[20]  Keith W. Ross,et al.  The KaZaA Overlay : A Measurement Study , 2004 .

[21]  Nikhil R. Devanur,et al.  Strategyproof cost-sharing mechanisms for set cover and facility location games , 2003, EC '03.

[22]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[23]  Xiang-Yang Li,et al.  Cost Sharing and Strategyproof Mechanisms for Set Cover Games , 2005, STACS.

[24]  Toshihide Ibaraki,et al.  Algorithmic Aspects of the Core of Combinatorial Optimization Games , 1999, Math. Oper. Res..

[25]  Tim Roughgarden,et al.  Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness , 2014, TEAC.

[26]  Henning Schulzrinne,et al.  An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol , 2004, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[27]  Éva Tardos,et al.  Near-optimal network design with selfish agents , 2003, STOC '03.

[28]  PanconesiAlessandro,et al.  Distributed weighted vertex cover via maximal matchings , 2008 .

[29]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[30]  Maria-Florina Balcan,et al.  Near Optimality in Covering and Packing Games by Exposing Global Information , 2011, ArXiv.

[31]  Jérôme Monnot,et al.  On the Impact of Local Taxes in a Set Cover Game , 2010, SIROCCO.

[32]  Satoru Iwata,et al.  Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[33]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[34]  Martin Hoefer,et al.  Selfish Service Installation in Networks , 2006, WINE.

[35]  Devavrat Shah,et al.  Dynamics in congestion games , 2010, SIGMETRICS '10.

[36]  Jun Li,et al.  Scalable supernode selection in peer-to-peer overlay networks , 2005, Second International Workshop on Hot Topics in Peer-to-Peer Systems.

[37]  Christos Koufogiannakis,et al.  Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost , 2013, Algorithmica.

[38]  Christos Koufogiannakis,et al.  Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost , 2009, ICALP.

[39]  Samir Khuller,et al.  A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers , 1994, J. Algorithms.

[40]  Martin Hoefer,et al.  Non-cooperative facility location and covering games , 2006, Theor. Comput. Sci..

[41]  Dorit S. Hochbaum,et al.  A fast approximation algorithm for the multicovering problem , 1986, Discret. Appl. Math..

[42]  Qizhi Fang,et al.  Core Stability of Vertex Cover Games , 2007, WINE.