On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
From MaRDI portal
Publication:2819450
DOI10.1007/978-3-662-53354-3_8zbMath1403.91061arXiv1412.0845OpenAlexW1518714012MaRDI QIDQ2819450
Publication date: 29 September 2016
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.0845
Related Items (4)
A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ On the robustness of the approximate price of anarchy in generalized congestion games
Cites Work
- Unnamed Item
- On the performance of approximate equilibria in congestion games
- Inefficiency of games with social context
- Potential games
- Some anomalies of farsighted strategic behavior
- A class of games possessing pure-strategy Nash equilibria
- On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
- On the Performance of Mildly Greedy Players in Cut Games
- On Linear Congestion Games with Altruistic Social Context
- On Lookahead Equilibria in Congestion Games
- Bounding the Inefficiency of Altruism through Social Contribution Games
- Exact Price of Anarchy for Polynomial Congestion Games
- On Stackelberg Strategies in Affine Congestion Games
- The price of anarchy of finite congestion games
- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
- Algorithms – ESA 2005
- Equilibrium points in n -person games
- The Price of Routing Unsplittable Flow
This page was built for publication: On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
