Non-cooperative facility location and covering games
From MaRDI portal
Publication:964406
DOI10.1016/j.tcs.2010.02.005zbMath1188.91020OpenAlexW2073627465MaRDI QIDQ964406
Publication date: 15 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.02.005
integer programmingNash equilibriumgamefacility locationgames on graphscost sharingapproximate equilibriumcomputational timeprice anarchy
Integer programming (90C10) Noncooperative games (91A10) Abstract computational complexity for mathematical programming problems (90C60) Games involving graphs (91A43) Combinatorial games (91A46)
Related Items
Non-cooperative capacitated facility location games ⋮ A new approach to cooperative competition in facility location problems: mathematical formulations and an approximation algorithm ⋮ On the performance of mildly greedy players in cut games ⋮ Strategies in competing subset selection ⋮ Allocating costs in set covering problems ⋮ Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players ⋮ Strategic cooperation in cost sharing games ⋮ Unnamed Item ⋮ Cournot-Stackelberg games in competitive delocation ⋮ Strategic multiway cut and multicut games ⋮ Resource buying games ⋮ LP-based covering games with low price of anarchy ⋮ Efficient Black-Box Reductions for Separable Cost Sharing ⋮ Set-weighted games and their application to the cover problem ⋮ On the sequential price of anarchy of isolation games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network design with weighted players
- Strong equilibrium in cost sharing connection games
- Non-cooperative tree creation
- Mechanism design for set cover games with selfish element agents
- Potential games
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- On a network creation game
- Algorithmic construction of sets for k -restrictions
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- Exact and Approximate Equilibria for Optimal Group Network Formation
- Price of Stability in Survivable Network Design
- On the Value of Coordination in Network Design
- Greedy Strikes Back: Improved Facility Location Algorithms
- Approximation algorithms for NP-complete problems on planar graphs
- The Online Median Problem
- Cooperative facility location games
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Applications of approximation algorithms to cooperative games
- Algorithms, games, and the internet
- Competitive Location Models: A Framework and Bibliography
- Integer Programming: Methods, Uses, Computations
- Non-cooperative Facility Location and Covering Games
- Algorithms – ESA 2005
- On spectrum sharing games
- STACS 2005
- Computing and Combinatorics
- The Price of Routing Unsplittable Flow
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
