A new model for selfish routing
- 1 October 2008
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 406 (3), 187-206
- https://doi.org/10.1016/j.tcs.2008.06.045
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Convergence time to Nash equilibrium in load balancingACM Transactions on Algorithms, 2007
- The Price of Selfish RoutingAlgorithmica, 2007
- Tight bounds for worst-case equilibriaACM Transactions on Algorithms, 2007
- Tradeoffs in worst-case equilibriaTheoretical Computer Science, 2006
- Selfish unsplittable flowsTheoretical Computer Science, 2005
- Structure and complexity of extreme Nash equilibriaTheoretical Computer Science, 2005
- Tighter bounds on a heuristic for a partition problemInformation Processing Letters, 1995
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973
- Über ein Paradoxon aus der VerkehrsplanungMathematical Methods of Operations Research, 1968
- ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952