Sensitivity of Wardrop equilibria
From MaRDI portal
Publication:987396
DOI10.1007/s00224-009-9196-4zbMath1203.90046OpenAlexW2129319165MaRDI QIDQ987396
Lars Olbrich, Thomas Franke, Matthias Englert
Publication date: 13 August 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/47592/1/fulltext21.pdf
Games involving graphs (91A43) Deterministic network models in operations research (90B10) Other game-theoretic models (91A40) Traffic problems in operations research (90B20)
Related Items
Sensitivity of wardrop equilibria: revisited ⋮ Stackelberg pricing games with congestion effects ⋮ The price of anarchy in routing games as a function of the demand ⋮ Price of anarchy for highly congested routing games in parallel networks ⋮ On the Price of Anarchy of Highly Congested Nonatomic Network Games ⋮ Escaping Braess's paradox through approximate Caratheodory's theorem
Cites Work
- Unnamed Item
- Unnamed Item
- On the severity of Braess's paradox: designing networks for selfish users is hard
- How bad is selfish routing?
- Sensitivity analysis for the asymmetric network equilibrium problem
- Über ein Paradoxon aus der Verkehrsplanung
- Traffic assignment problem for a general network
- The price of anarchy is independent of the network topology
