Theoretical upper bounds for price of anarchy have been calculated in previous studies. We present an empirical analysis for the price of anarchy for congested transportation networks; different network sizes and demand levels are considered for each network. We obtain a maximum price of anarchy for the cases studied, which is notably lower than the theoretical bounds reported in the literature. This result should be carefully considered in the design and implementation of road pricing mechanisms for cities.
Numerical Bounds on the Price of Anarchy
2017
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Price of anarchy for non-atomic congestion games with stochastic demands
Online Contents | 2014
|Price of anarchy for reliability-based traffic assignment and network design
Taylor & Francis Verlag | 2015
|Mechanisms that govern how the Price of Anarchy varies with travel demand
Online Contents | 2016
|