License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2011.122
URN: urn:nbn:de:0030-drops-32727
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3272/
Buriol, Luciana ;
Ritt, Marcus ;
Rodrigues, Felix ;
Schäfer, Guido
On the Smoothed Price of Anarchy of the Traffic Assignment Problem
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.
BibTeX - Entry
@InProceedings{buriol_et_al:OASIcs:2011:3272,
author = {Luciana Buriol and Marcus Ritt and Felix Rodrigues and Guido Sch{\"a}fer},
title = {{On the Smoothed Price of Anarchy of the Traffic Assignment Problem}},
booktitle = {11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {122--133},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-939897-33-0},
ISSN = {2190-6807},
year = {2011},
volume = {20},
editor = {Alberto Caprara and Spyros Kontogiannis},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3272},
URN = {urn:nbn:de:0030-drops-32727},
doi = {10.4230/OASIcs.ATMOS.2011.122},
annote = {Keywords: Traffic Assignment Problem, Smoothed Analysis, Price of Anarchy}
}
Keywords: |
|
Traffic Assignment Problem, Smoothed Analysis, Price of Anarchy |
Collection: |
|
11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems |
Issue Date: |
|
2011 |
Date of publication: |
|
19.09.2011 |