OASIcs.ATMOS.2011.122.pdf
- Filesize: 0.76 MB
- 12 pages
Document
On the Smoothed Price of Anarchy of the Traffic Assignment Problem
Authors
-
Part of:
Volume:
11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2011)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-09-19
Cite AsGet BibTex
Luciana Buriol, Marcus Ritt, Felix Rodrigues, and Guido Schäfer. On the Smoothed Price of Anarchy of the Traffic Assignment Problem. In 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 20, pp. 122-133, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/OASIcs.ATMOS.2011.122
https://doi.org/10.4230/OASIcs.ATMOS.2011.122
Abstract
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.
Keywords
- Traffic Assignment Problem
- Smoothed Analysis
- Price of Anarchy
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads