Competitive routing over time
Authors:
- Martin HoeferMHMartin Hoefer
- Vahab S. MirrokniVMVahab S. Mirrokni
- Heiko RöglinHRHeiko Röglin
- Shang-Hua TengSTShang-Hua Teng
- 1 September 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (39) , 5420-5432
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- On the impact of combinatorial structure on congestion gamesJournal of the ACM, 2008
- Selfish Load Balancing2007
- Routing Games2007
- Convergence in a continuous dynamic queueing model for traffic networksTransportation Research Part B: Methodological, 2006
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networksTransportation Research Part B: Methodological, 1993
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973
- Dynamic traffic assignment by individual path minimization and queuingTransportation Research, 1971
- CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952