Adaptive routing with stale information

DOI10.1016/J.TCS.2008.01.055zbMath1168.90365OpenAlexW1996350158MaRDI QIDQ838148

Berthold Vöcking, Simon Fischer

Publication date: 21 August 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.055

zbMATH Keywords

game theoryadaptive routingWardrop modelstale information

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43) Stochastic network models in operations research (90B15) Evolutionary games (91A22)

Related Items (4)

Concurrent imitation dynamics in congestion games ⋮ Wardrop equilibrium on time-varying graphs ⋮ The Value of Information in Selfish Routing ⋮ Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks

Cites Work

• Bounding the inefficiency of equilibria in nonatomic congestion games
• How much can taxes help selfish routing?
• The effect of collusion in congestion games
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• How bad is selfish routing?
• Adaptive routing with end-to-end feedback
• Adaptive routing with stale information
• Routing without regret
• How useful is old information (extended abstract)?
• Algorithms – ESA 2004
• Automata, Languages and Programming
• The price of anarchy is independent of the network topology
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adaptive routing with stale information