Bounding quality of pure Nash equilibria in dual-role facility location games
From MaRDI portal
(Redirected from Publication:2091109)
Recommendations
- Mechanisms for dual-role-facility location games: truthfulness and approximability
- Improved Bounds for Facility Location Games with Fair Cost Allocation
- Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game
- On the power of deterministic mechanisms for facility location games
- Methods for computing Nash equilibria of a location-quantity game
- Reachability of locational Nash equilibria
- On Nash equilibria of a competitive location-design problem
- Computation of multi-facility location Nash equilibria on a network under quantity competition
- Constrained heterogeneous two-facility location games with max-variant cost
Cites work
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- Algorithmic Game Theory
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Candidate positioning and entry in a political competition
- Facility location and supply chain management. A review
- Finding Groups in Data
- Greedy Strikes Back: Improved Facility Location Algorithms
- Heuristics for the fixed cost median problem
- Intrinsic robustness of the price of anarchy
- Location Games on Networks: Existence and Efficiency of Equilibria
- Multiunit facility location games
- Topological design of telecommunication networks --- local access design methods
This page was built for publication: Bounding quality of pure Nash equilibria in dual-role facility location games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2091109)
