Robust bottleneck routing games

DOI10.1002/NET.21606MaRDI QIDQ4642450zbMATH OpenOpenAlexFDO

Authors T. L. Werth, Sabine Büttner, Sven O. Krumke

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21606

zbMATH Keywords

atomic unsplittable flowsequilibriagame theoryoptimal solutionsprice of robustnessrobust Nash equilibriarobust optimizationrouting

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• The equilibrium existence of a robust routing game under interval uncertainty
• Robust Wardrop Equilibrium
• Bottleneck routing with elastic demands
• Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games
• Computation of equilibria and the price of anarchy in bottleneck congestion games

Cited in

(13)

• On the core of routing games
• The equilibrium existence of a robust routing game under interval uncertainty
• Weakly-acyclic (internet) routing games
• The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
• Bottleneck routing with elastic demands
• Stretch in Bottleneck Games
• Extending concepts of reliability. Network creation games, real-time scheduling, and robust optimization
• Weakly-Acyclic (Internet) Routing Games
• Bottleneck routing with elastic demands
• Generalized bounded rationality and robust multicommodity network design
• On the core of routing games with revenues
• The Hardness of Selective Network Design for Bottleneck Routing Games
• “Beat-Your-Rival” Routing Games

This page was built for publication: Robust bottleneck routing games

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