Sensitivity of Wardrop Equilibria
From MaRDI portal
Publication:5459981
DOI10.1007/978-3-540-79309-0_15zbMath1136.90317OpenAlexW4254198007MaRDI QIDQ5459981
Thomas Franke, Lars Olbrich, Matthias Englert
Publication date: 2 May 2008
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/47592/1/fulltext21.pdf
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item