How to find Nash equilibria with extreme total latency in network congestion games?

DOI10.1007/S00186-009-0293-6zbMath1189.91039OpenAlexW3189740326MaRDI QIDQ966426

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

zbMATH Keywords

complexityextreme equilibrianetwork congestion gametotal latency

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A logarithmic approximation for polymatroid congestion games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure and complexity of worst-case equilibria
• How hard is it to find extreme Nash equilibria in network congestion games?
• A class of games possessing pure-strategy Nash equilibria
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• The price of selfish routing
• Algorithms, games, and the internet
• Approximation and Online Algorithms
• The Price of Routing Unsplittable Flow

This page was built for publication: How to find Nash equilibria with extreme total latency in network congestion games?