Fast convergence of selfish rerouting

MaRDI QIDQ2921740zbMATH OpenFDO

Authors Eyal Even-Dar, Yishay Mansour

Publication date 13 October 2014

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14)

Recommendations

• The price of selfish routing
• Distributed selfish load balancing on networks
• Distributed selfish load balancing on networks
• The price of selfish routing
• Tradeoffs and average-case equilibria in selfish routing

Cited in

(15)

• Greedy distributed optimization of multi-commodity flows
• Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
• Concurrent imitation dynamics in congestion games
• Approximating Wardrop equilibria with finitely many agents
• Distributed Learning of Wardrop Equilibria
• Management of Variable Data Streams in Networks
• Nonadaptive Selfish Routing with Online Demands
• Atomic Congestion Games: Fast, Myopic and Concurrent
• A simple approach for adapting continuous load balancing processes to discrete settings
• scientific article; zbMATH DE number 7774260 (Why is no real title available?)
• Using Temporal Dummy Players in Cost-Sharing Games
• Convergence to approximate Nash equilibria in congestion games
• Memory loss can prevent chaos in games dynamics
• Distributed algorithms for QoS load balancing
• Atomic congestion games: fast, myopic and concurrent

This page was built for publication: Fast convergence of selfish rerouting

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