Approximating Wardrop equilibria with finitely many agents

DOI10.1007/S00446-008-0057-1zbMath1267.68308OpenAlexW1997173893MaRDI QIDQ352247

Lars Olbrich, Simon Fischer, Berthold Vöcking

Publication date: 4 July 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-008-0057-1

zbMATH Keywords

adaptive routingWardrop model

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (2)

Wardrop equilibrium on time-varying graphs ⋮ Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• How much can taxes help selfish routing?
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• How bad is selfish routing?
• Adaptive routing with end-to-end feedback
• Distributed selfish load balancing
• Network Games with Atomic Players
• Adaptive routing with stale information
• Routing without regret
• Greedy distributed optimization of multi-commodity flows
• Automata, Languages and Programming
• Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game

This page was built for publication: Approximating Wardrop equilibria with finitely many agents