On the Smoothed Price of Anarchy of the Traffic Assignment Problem

Luciana Buriol, Marcus Ritt, Felix Rodrigues & Guido SchäFer
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.