Braess’s Paradox for Flows over Time
Authors:
- 5 April 2013
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 53 (1) , 86-106
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Network topology and the efficiency of equilibriumGames and Economic Behavior, 2006
- On the severity of Braess's Paradox: Designing networks for selfish users is hardJournal of Computer and System Sciences, 2006
- On a Paradox of Traffic PlanningTransportation Science, 2005
- Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated NetworksTransportation Science, 2003
- How bad is selfish routing?Journal of the ACM, 2002
- Foundations of Dynamic Traffic Assignment: The Past, the Present and the FutureNetworks and Spatial Economics, 2001
- On the relationship between Nash—Cournot and Wardrop equilibriaNetworks, 1985
- Dynamic traffic assignment by individual path minimization and queuingTransportation Research, 1971
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958