Work

On the Smoothed Price of Anarchy of the Traffic Assignment Problem

Year: 2011

Type: article

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.

Source: DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

DOI: 10.4230/oasics.atmos.2011.122

Authors: Buriol, Luciana, Ritt, Marcus, Rodrigues, Felix, Schäfer, Guido

Institutions: Universidade Federal do Rio Grande do Sul, Centrum Wiskunde & Informatica

Language: English

Topic: Transportation Planning and Optimization

Subfield: Transportation

Field: Social Sciences

Domain: Social Sciences

Open Access status: green

OpenAlex ID: W2240405590

FWCI: 1.853

Cites: 7

Cited by: 5

Related to: 10