Non-cooperative facility location and covering games

Authors:
Jean Cardinal;Martin Hoefer
Affiliations:
Computer Science Department, Université Libre de Bruxelles, Belgium;Department of Computer Science, RWTH Aachen, Germany
Venue:
Theoretical Computer Science
Year:
2010

Citing 34
Cited 5

Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Greedy strikes back: improved facility location algorithms

Journal of Algorithms
Algorithmic Aspects of the Core of Combinatorial Optimization Games

Mathematics of Operations Research
Applications of approximation algorithms to cooperative games

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms

Approximation algorithms
How bad is selfish routing?

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Online Median Problem

SIAM Journal on Computing
On a network creation game

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Group Strategyproof Mechanisms via Primal-Dual Algorithms

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Cooperative facility location games

Journal of Algorithms - Special issue: SODA 2000
On spectrum sharing games

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The Price of Routing Unsplittable Flow

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Equilibria in topology control games for ad hoc networks

Mobile Networks and Applications
Algorithmic construction of sets for k-restrictions

ACM Transactions on Algorithms (TALG)
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
Designing networks with good equilibria

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Limitations of cross-monotonic cost-sharing schemes

ACM Transactions on Algorithms (TALG)
Online multicast with egalitarian cost sharing

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Non-Cooperative Tree Creation

Algorithmica
Network Design with Weighted Players

Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
Mechanism design for set cover games with selfish element agents

Theoretical Computer Science
The Price of Stability for Network Design with Fair Cost Allocation

SIAM Journal on Computing
On the Value of Coordination in Network Design

SIAM Journal on Computing
Strategyproof cost-sharing mechanisms for set cover and facility location games

Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Selfish service installation in networks

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
On the price of anarchy and stability of correlated equilibria of linear congestion games,,

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Geometric network design with selfish agents

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Price of anarchy, locality gap, and a network service provider game

WINE'05 Proceedings of the First international conference on Internet and Network Economics
Cost sharing and strategyproof mechanisms for set cover games

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Non-cooperative facility location and covering games

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Strategic cooperation in cost sharing games

WINE'10 Proceedings of the 6th international conference on Internet and network economics
Survey: Covering problems in facility location: A review

Computers and Industrial Engineering
Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure

Proceedings of the 13th ACM Conference on Electronic Commerce
Resource buying games

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
LP-Based covering games with low price of anarchy

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.