Computing approximate Nash equilibria in network congestion games

DOI10.1002/NET.20444MaRDI QIDQ2913950zbMATH OpenOpenAlexFDO

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

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

algorithmic game theoryapproximate Nash equilibriacongestion games

Mathematics Subject Classification ID

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

Recommendations

• Computing Approximate Nash Equilibria in Network Congestion Games
• Efficient computation of approximate pure Nash equilibria in congestion games
• Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
• Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
• Convergence to approximate Nash equilibria in congestion games

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Convergence to approximate Nash equilibria in congestion games
• How bad is selfish routing?
• scientific article; zbMATH DE number 5485547 (Why is no real title available?)
• scientific article; zbMATH DE number 3069542 (Why is no real title available?)
• Probability and Computing
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games

Cited in

(11)

• Nonlinear game models for large-scale network bandwidth management
• How hard is it to find extreme Nash equilibria in network congestion games?
• Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
• On approximate Nash equilibria in network design
• Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
• Computing Approximate Nash Equilibria in Network Congestion Games
• Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
• Nash dynamics in constant player and bounded jump congestion games
• Representation of finite games as network congestion games
• Network spot‐checking games: Theory and application to toll enforcing in transportation networks
• Efficient computation of approximate pure Nash equilibria in congestion games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913950)