Tight Bounds for Cost-Sharing in Weighted Congestion Games
From MaRDI portal
Publication:3449511
DOI10.1007/978-3-662-47666-6_50zbMath1447.91013OpenAlexW1134766267MaRDI QIDQ3449511
Konstantinos Kollias, Martin Gairing, Grammateia Kotsialou
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: http://livrepository.liverpool.ac.uk/3003315/2/general.pdf
Related Items (4)
Cost-Sharing in Generalised Selfish Routing ⋮ Designing cost-sharing methods for Bayesian games ⋮ A Characterization of Undirected Graphs Admitting Optimal Cost Shares ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems
Cites Work
- Worst-case equilibria
- Network design with weighted players
- Potential games
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- A class of games possessing pure-strategy Nash equilibria
- Optimal Cost-Sharing in Weighted Congestion Games
- Network Cost-Sharing without Anonymity
- Sharing Non-anonymous Costs of Multiple Resources Optimally
- Restoring Pure Equilibria to Weighted Congestion Games
- Designing Network Protocols for Good Equilibria
- Exact Price of Anarchy for Polynomial Congestion Games
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- On duality theory of convex semi-infinite programming
- The price of anarchy of finite congestion games
- Intrinsic robustness of the price of anarchy
- Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
- Price of Stability in Polynomial Congestion Games
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
- The Price of Routing Unsplittable Flow
This page was built for publication: Tight Bounds for Cost-Sharing in Weighted Congestion Games
