Algorithms – ESA 2004

DOI10.1007/B100428zbMATH Open1111.68312OpenAlexW2483610301MaRDI QIDQ5464591FDOQ5464591

Authors: Simon Fischer, Berthold Vöcking 

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100428

Recommendations

• Competitive routing over time
• Equilibria in dynamic selfish routing
• The price of selfish routing
• Selfish Routing in Capacitated Networks
• Tradeoffs and average-case equilibria in selfish routing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of game theory (91A80) Evolutionary games (91A22) Network design and communication in computer systems (68M10)

Cited In (12)

• A nonlinear pairwise swapping dynamics to model the selfish rerouting evolutionary game
• Bounding Residence Times for Atomic Dynamic Routings
• Load balancing without regret in the bulletin board model
• Adaptive routing with stale information
• Online learning of Nash equilibria in congestion games
• Management of Variable Data Streams in Networks
• Best-reply dynamics in large binary-choice anonymous games
• How bad is selfish routing?
• The Price of Stochastic Anarchy
• Atomic dynamic flow games: adaptive vs. nonadaptive agents
• Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation
• Evolutionary equilibrium in Bayesian routing games: specialization and niche formation

This page was built for publication: Algorithms – ESA 2004

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