The Price of Anarchy in Transportation Networks: Data-Driven Evaluation and Reduction Strategies
Open Access
- 5 February 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 106 (4) , 538-553
Abstract
Among the many functions a smart city must support, transportation dominates in terms of resource consumption, strain on the environment, and frustration of its citizens. We study transportation networks under two different routing policies, the commonly assumed selfish user-centric routing policy and a socially optimal system-centric one. We consider a performance metric of efficiency-the Price of Anarchy (PoA)-defined as the ratio of the total travel latency cost under selfish routing over the corresponding quantity under socially optimal routing. We develop a data-driven approach to estimate the PoA, which we subsequently use to conduct a case study using extensive actual traffic data from the Eastern Massachusetts road network. To estimate the PoA, our approach learns from data a complete model of the transportation network, including origin-destination demand and user preferences. We leverage this model to propose possible strategies to reduce the PoA and increase efficiency.Keywords
Funding Information
- National Science Foundation (NSF) (CNS-1645681, ECCS-1509084, CCF-1527292, IIS-1237022, IIP-1430145)
- U.S. Department of Energy (DOE) (DE-AR0000796)
- Air Force Office of Scientific Research (AFOSR) (FA9550-15-1-0471)
- Army Research Office (ARO) (W911NF-12-1-0390)
- Bosch
- The MathWorks
This publication has 25 references indexed in Scilit:
- Autonomous vehicle control systems for safe crossroadsTransportation Research Part C: Emerging Technologies, 2011
- Price of Anarchy in Transportation Networks: Efficiency and Optimality ControlPhysical Review Letters, 2008
- A heuristic for the bilevel origin–destination-matrix estimation problemTransportation Research Part B: Methodological, 2008
- Estimation of origin–destination matrices from link flows on uncongested networksTransportation Research Part B: Methodological, 2000
- A multiclass, multicriteria traffic network equilibrium modelMathematical and Computer Modelling, 2000
- Sensitivity analysis for the elastic-demand network equilibrium problem with applicationsTransportation Research Part B: Methodological, 1997
- Dynamic traffic assignment for urban road networksTransportation Research Part B: Methodological, 1991
- Link capacity functions: A reviewTransportation Research, 1976
- An efficient approach to solving the road network equilibrium traffic assignment problemTransportation Research, 1975
- CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952