Approximating Wardrop equilibria with finitely many agents

DOI10.1007/S00446-008-0057-1MaRDI QIDQ352247zbMATH OpenOpenAlexFDO

Authors Lars Olbrich, Berthold Vöcking, Simon Fischer

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)

Recommendations

• Approximating Wardrop Equilibria with Finitely Many Agents
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games
• Wardrop equilibrium on time-varying graphs

Cites work

• scientific article; zbMATH DE number 1239298 (Why is no real title available?)
• scientific article; zbMATH DE number 2119661 (Why is no real title available?)
• A guided tour of Chernoff bounds
• Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
• Adaptive routing with stale information
• Automata, Languages and Programming
• Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
• Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
• Distributed selfish load balancing
• Fast convergence of selfish rerouting
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• Greedy distributed optimization of multi-commodity flows
• How bad is selfish routing?
• How much can taxes help selfish routing?
• Network Games with Atomic Players
• Network flows. Theory, algorithms, and applications.
• Routing without regret, on convergence to Nash equilibria of regret-minimizing algorithms in routing games

Cited in

(9)

• Approximating Wardrop Equilibria with Finitely Many Agents
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• Computing all Wardrop equilibria parametrized by the flow demand
• scientific article; zbMATH DE number 5267097 (Why is no real title available?)
• Existence of equilibrium with nonconvexities and finitely many agents
• Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks
• Wardrop equilibrium on time-varying graphs
• Distributed Learning of Wardrop Equilibria
• Fast convergence to Wardrop equilibria by adaptive sampling methods

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

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