Non-cooperative facility location and covering games

We consider a general class of non-cooperative games related to combinatorial covering and facility location problems. A game is based on an integer programming formulation of the corresponding optimization problem, and each of the k players wants to satisfy a subset of the constraints. For that purpose, resources available in integer units must be bought, and their cost can be shared arbitrarily between players. We consider the existence and cost of exact and approximate pure-strategy Nash equilibria. In general, the prices of anarchy and stability are in @Q(k) and deciding the existence of a pure Nash equilibrium is NP-hard. Under certain conditions, however, cheap Nash equilibria exist, in particular if the integrality gap of the underlying integer program is 1, or in the case of single constraint players. We also present algorithms that compute simultaneously near-stable and near-optimal approximate Nash equilibria in polynomial time.

[1]  Noga Alon,et al.  Algorithmic construction of sets for k-restrictions , 2006, TALG.

[2]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[3]  Claire Mathieu,et al.  Online multicast with egalitarian cost sharing , 2008, SPAA '08.

[4]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[5]  Joseph Naor,et al.  Non-Cooperative Multicast and Facility Location Games , 2006, IEEE Journal on Selected Areas in Communications.

[6]  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..

[7]  Jaroslaw Byrka.  An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2007, APPROX-RANDOM.

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

[9]  Mohammad Mahdian,et al.  Improved Approximation Algorithms for Metric Facility Location Problems , 2002, APPROX.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Vahab S. Mirrokni,et al.  On spectrum sharing games , 2004, PODC '04.

[12]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[14]  Adrian Vetta,et al.  Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[15]  Nikhil R. Devanur,et al.  Strategyproof cost-sharing Mechanisms for Set Cover and Facility Location Problems , 2002 .

[16]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[17]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[18]  Martin Hoefer.  Non-cooperative Facility Location and Covering Games , 2006, ISAAC.

[19]  Xiaotie Deng.  Combinatorial optimization games , 1997, SODA '97.

[20]  Nikhil R. Devanur,et al.  Price of Anarchy, Locality Gap, and a Network Service Provider Game , 2005, WINE.

[21]  C. Greg Plaxton,et al.  The online median problem , 1999, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[22]  Tim Roughgarden,et al.  Designing networks with good equilibria , 2008, SODA '08.

[23]  Xiang-Yang Li,et al.  Cost sharing and strategyproof mechanisms for set cover games , 2005, J. Comb. Optim..

[24]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[25]  Martin Skutella,et al.  Cooperative facility location games , 2000, SODA '00.

[26]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[27]  Martin Hoefer,et al.  Geometric Network Design with Selfish Agents , 2005, COCOON.

[28]  L. Shapley,et al.  Potential Games , 1994 .

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

[30]  T. Friesz,et al.  Equilibrium Facility Location on Networks , 1995 .

[31]  Stephan Eidenbenz,et al.  Equilibria in Topology Control Games for Ad Hoc Networks , 2006, Mob. Networks Appl..

[32]  Elliot Anshelevich,et al.  Price of Stability in Survivable Network Design , 2009, SAGT.

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

[34]  Tim Roughgarden,et al.  Network Design with Weighted Players , 2006, SPAA '06.

[35]  Xiang-Yang Li,et al.  Mechanism Design for Set Cover Games When Elements Are Agents , 2005, AAIM.

[36]  Vijay V. Vazirani,et al.  Applications of approximation algorithms to cooperative games , 2001, STOC '01.

[37]  Toshihide Ibaraki,et al.  Some Duality Properties of Combinatorial Optimization Games(Optimization Theory in Descrete and Continuous Mathematical Sciences) , 1997 .

[38]  Susanne Albers,et al.  On the value of coordination in network design , 2008, SODA '08.

[39]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[40]  Yossi Azar,et al.  The Price of Routing Unsplittable Flow , 2005, STOC '05.

[41]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

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

[43]  Elias Koutsoupias,et al.  On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games , 2005, ESA.

[44]  Elliot Anshelevich,et al.  Exact and Approximate Equilibria for Optimal Group Network Formation , 2009, ESA.

[45]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[46]  Martin Hoefer,et al.  Non-Cooperative Tree Creation , 2006, Algorithmica.

[47]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computation , 2010, 50 Years of Integer Programming.

[48]  Jochen Könemann,et al.  Group-Strategyproof Mechanisms for Network Design Games via Primal-Dual Algorithms , 2008 .

[49]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[50]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[51]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[52]  Gilbert Laporte,et al.  Competitive Location Models: A Framework and Bibliography , 1993, Transp. Sci..

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

[54]  Yishay Mansour,et al.  Strong equilibrium in cost sharing connection games , 2007, EC '07.