Computing Approximate Nash Equilibria in Network Congestion Games
From MaRDI portal
Publication:3511400
DOI10.1007/978-3-540-69355-0_18zbMath1143.91313MaRDI QIDQ3511400
Heiko Röglin, Andreas Emil Feldmann, Berthold Vöcking
Publication date: 10 July 2008
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69355-0_18
91A43: Games involving graphs
Cites Work
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- A class of games possessing pure-strategy Nash equilibria
- How bad is selfish routing?
- On the impact of combinatorial structure on congestion games
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Probability and Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item