How to find Nash equilibria with extreme total latency in network congestion games?
From MaRDI portal
Publication:966426
Recommendations
- How hard is it to find extreme Nash equilibria in network congestion games?
- Theoretical Computer Science
- Structure and complexity of extreme Nash equilibria
- Complexity of pure Nash equilibria in player-specific network congestion games
- On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
Cites work
- scientific article; zbMATH DE number 2038735 (Why is no real title available?)
- scientific article; zbMATH DE number 2119691 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- Algorithms, games, and the internet
- Approximation and Online Algorithms
- How hard is it to find extreme Nash equilibria in network congestion games?
- On the structure and complexity of worst-case equilibria
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- The price of routing unsplittable flow
- The price of selfish routing
- Worst-case equilibria
Cited in
(3)
This page was built for publication: How to find Nash equilibria with extreme total latency in network congestion games?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966426)
