Computing approximate Nash equilibria in network congestion games

DOI10.1002/net.20444zbMath1247.91037OpenAlexW2147373582MaRDI QIDQ2913950

Berthold Vöcking, Andreas Emil Feldmann, Heiko Röglin

Publication date: 21 September 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20444

zbMATH Keywords

congestion gamesalgorithmic game theoryapproximate Nash equilibria

Mathematics Subject Classification ID

Games involving graphs (91A43) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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?
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• Probability and Computing

This page was built for publication: Computing approximate Nash equilibria in network congestion games