Tradeoffs and Average-Case Equilibria in Selfish Routing

DOI10.1007/978-3-540-75520-3_8zbMath1151.91332OpenAlexW1491336073MaRDI QIDQ5900365

Martin Hoefer, Alexander Souza

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_8

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Atomic routing games on maximum congestion ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ The Influence of Link Restrictions on (Random) Selfish Routing ⋮ Resource Management in Large Networks

This page was built for publication: Tradeoffs and Average-Case Equilibria in Selfish Routing