×

On the smoothed price of anarchy of the traffic assignment problem. (English) Zbl 1247.90088

Caprara, Alberto (ed.) et al., 11th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS 2011). Selected papers based on the presentations at the workshop, September 8, 2011, Saarbrücken, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-33-0). OASIcs – OpenAccess Series in Informatics 20, 122-133, electronic only (2011).
Summary: 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.
For the entire collection see [Zbl 1247.90006].

MSC:

90B20 Traffic problems in operations research
90B80 Discrete location and assignment
91A80 Applications of game theory
PDFBibTeX XMLCite
Full Text: DOI