2026-07-22T13:39:11Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3272 2024-03-06T10:28:56Z ddc:004 open_access

On the Smoothed Price of Anarchy of the Traffic Assignment Problem Buriol, Luciana Ritt, Marcus Rodrigues, Felix Schäfer, Guido Traffic Assignment Problem Smoothed Analysis Price of Anarchy 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Luciana Buriol and Marcus Ritt and Felix Rodrigues and Guido Schäfer 2011 Is Part Of OASIcs, Volume 20, 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2011.122 urn:nbn:de:0030-drops-32727 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2011.122 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode