The Price of Stability of Weighted Congestion Games
From MaRDI portal
Publication:5242923
DOI10.1137/18M1207880;zbMath1426.91048arXiv1802.09952MaRDI QIDQ5242923
Yiannis Giannakopoulos, George Christodoulou, Martin Gairing, Paul G. Spirakis
Publication date: 8 November 2019
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.09952
Related Items (6)
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ On approximate pure Nash equilibria in weighted congestion games with polynomial latencies ⋮ Congestion games with priority-based scheduling ⋮ The Price of Stability of Weighted Congestion Games ⋮ A unifying approximate potential for weighted congestion games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the performance of approximate equilibria in congestion games
- Tight bounds for selfish and greedy load balancing
- Characterizing the existence of potential functions in weighted congestion games
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
- Network design with weighted players
- The structure and complexity of Nash equilibria for a selfish routing game
- Potential games
- Bounding the inefficiency of equilibria in nonatomic congestion games
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- Strong equilibria in games with the lexicographical improvement property
- Improved lower bounds on the price of stability of undirected network design games
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Approximate Pure Nash Equilibria in Weighted Congestion Games
- Exact Price of Anarchy for Polynomial Congestion Games
- Johann Faulhaber and Sums of Powers
- On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
- Intrinsic Robustness of the Price of Anarchy
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- On the impact of combinatorial structure on congestion games
- Algorithms for pure Nash equilibria in weighted congestion games
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- On the Value of Coordination in Network Design
- Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games
- The Price of Stability of Weighted Congestion Games
- Price of Stability in Polynomial Congestion Games
- Algorithmic Game Theory
- Algorithms – ESA 2005
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
- Analytic Inequalities
- The network equilibrium problem in integers
- The Price of Routing Unsplittable Flow
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
- Atomic resource sharing in noncooperative networks
This page was built for publication: The Price of Stability of Weighted Congestion Games
