Nash Equilibria and the Price of Anarchy for Flows over Time
Authors:
- 16 November 2010
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 49 (1) , 71-97
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Convergence in a continuous dynamic queueing model for traffic networksTransportation Research Part B: Methodological, 2006
- Consistent objectives and solution of dynamic user equilibrium modelsTransportation Research Part B: Methodological, 2006
- A cell-based simultaneous route and departure time choice model with elastic demandTransportation Research Part B: Methodological, 2004
- A dynamic traffic equilibrium assignment paradoxTransportation Research Part B: Methodological, 2000
- The continuous dynamic network loading problem: a mathematical formulation and solution methodTransportation Research Part B: Methodological, 1998
- A model and an algorithm for the dynamic user-optimal route choice problemTransportation Research Part B: Methodological, 1998
- A link-based variational inequality model for dynamic departure time/route choiceTransportation Research Part B: Methodological, 1996
- 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
- Dynamic traffic assignment by individual path minimization and queuingTransportation Research, 1971
- Über ein Paradoxon aus der VerkehrsplanungMathematical Methods of Operations Research, 1968