Algorithms – ESA 2004

DOI10.1007/B100428MaRDI QIDQ5464591zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(14)

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

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)