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.
|Titolo:||Price of Anarchy for Highly Congested Routing Games in Parallel Networks|
|Data di pubblicazione:||Being printed|
|Appare nelle tipologie:||01.1 - Articolo su rivista (Article)|
File in questo prodotto:
|TOCSfrthCCS.pdf||Documento in Post-print||NON PUBBLICO - Accesso privato/ristretto||Administrator|