eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2011-09-19
122
133
10.4230/OASIcs.ATMOS.2011.122
article
On the Smoothed Price of Anarchy of the Traffic Assignment Problem
Buriol, Luciana
Ritt, Marcus
Rodrigues, Felix
Schäfer, Guido
We study the effect of perturbations on the Price of Anarchy for the Traffic Assignment Problem. Adopting the smoothed analysis approach, we randomly perturb the latency functions of the given network and estimate the expected Price of Anarchy on the perturbed instances. We provide both theoretical and experimental results that show that the Smoothed Price of Anarchy is of the same order of magnitude as the original one.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol020-atmos2011/OASIcs.ATMOS.2011.122/OASIcs.ATMOS.2011.122.pdf
Traffic Assignment Problem
Smoothed Analysis
Price of Anarchy