On the robustness of the approximate price of anarchy in generalized congestion games
From MaRDI portal
Publication:2077399
DOI10.1016/j.tcs.2022.01.008OpenAlexW4226304702MaRDI QIDQ2077399
Publication date: 21 February 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.0845
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the performance of approximate equilibria in congestion games
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
- Inefficiency of games with social context
- Stackelberg strategies for atomic congestion games
- Potential games
- Congestion games with priority-based scheduling
- The price of anarchy of affine congestion games with similar strategies
- On Stackelberg strategies in affine congestion games
- A class of games possessing pure-strategy Nash equilibria
- Data-driven models of selfish routing: why price of anarchy does depend on network topology
- On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
- On Linear Congestion Games with Altruistic Social Context
- Bounding the Inefficiency of Altruism through Social Contribution Games
- On lookahead equilibria in congestion games
- Exact Price of Anarchy for Polynomial Congestion Games
- The price of anarchy of finite congestion games
- Robust Price of Anarchy Bounds via LP and Fenchel Duality
- 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
