Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
From MaRDI portal
Publication:3460781
DOI10.1007/978-3-662-48995-6_9zbMath1404.91044MaRDI QIDQ3460781
Luca Moscardelli, Vittorio Bilò, Michele Flammini, Gianpiero Monaco
Publication date: 8 January 2016
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48995-6_9
91A12: Cooperative games
91A43: Games involving graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
91-04: Software, source code, etc. for problems pertaining to game theory, economics, and finance
Related Items
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies, Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved approximation algorithms for directed Steiner forest
- How easy is local search?
- Potential games
- A class of games possessing pure-strategy Nash equilibria
- On Approximate Nash Equilibria in Network Design
- The Price of Stability for Network Design with Fair Cost Allocation
- On the impact of combinatorial structure on congestion games
- The complexity of pure Nash equilibria
- Approximation Algorithms for Directed Steiner Problems
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
- Equilibrium points in n -person games