Price of Anarchy for Highly Congested Routing Games in Parallel Networks

Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

7 Citas (Scopus)

Resumen

We consider nonatomic routing games with one source and one destination connected by multiple parallel edges. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some empirical observations, we prove that under suitable conditions on the costs the price of anarchy is asymptotic to one. We show with some counterexamples that this is not always the case, and that these counterexamples already occur in simple networks with only 2 parallel links.

Idioma originalInglés
Páginas (desde-hasta)90-113
Número de páginas24
PublicaciónTheory of Computing Systems
Volumen63
N.º1
DOI
EstadoPublicada - 15 ene. 2019

Huella

Profundice en los temas de investigación de 'Price of Anarchy for Highly Congested Routing Games in Parallel Networks'. En conjunto forman una huella única.

Citar esto