How to find Nash equilibria with extreme total latency in network congestion games?
DOI10.1007/S00186-009-0293-6zbMATH Open1189.91039OpenAlexW3189740326MaRDI QIDQ966426FDOQ966426
Authors: Heike Sperber 
Publication date: 23 April 2010
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2034
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Noncooperative games (91A10) Games involving graphs (91A43)
Cites Work
- Worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Algorithms, games, and the internet
- Approximation and Online Algorithms
- The price of routing unsplittable flow
- Title not available (Why is that?)
- The price of selfish routing
- Title not available (Why is that?)
- How hard is it to find extreme Nash equilibria in network congestion games?
- On the structure and complexity of 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)
