TY - JOUR
T1 - Price of Anarchy for Highly Congested Routing Games in Parallel Networks
AU - Colini-Baldeschi, Riccardo
AU - Cominetti, Roberto
AU - Scarsini, Marco
N1 - Funding Information:
Acknowledgments Riccardo Colini-Baldeschi is a member of GNAMPA-INdAM. Roberto Cominetti gratefully acknowledges the support and hospitality of LUISS during a visit in which this research was initiated. Roberto Cominetti’s research is also supported by FONDECYT 1130564 and Núcleo Milenio ICM/FIC RC130003 “Información y Coordinación en Redes”. Marco Scarsini is a member of GNAMPA-INdAM. He gratefully acknowledges the support and hospitality of FONDECYT 1130564 and Núcleo Milenio “Información y Coordinación en Redes”.
Funding Information:
Riccardo Colini-Baldeschi is a member of GNAMPA-INdAM. Roberto Cominetti gratefully acknowledges the support and hospitality of LUISS during a visit in which this research was initiated. Roberto Cominetti?s research is also supported by FONDECYT 1130564 and N?cleo Milenio ICM/FIC RC130003 ?Informaci?n y Coordinaci?n en Redes ?. Marco Scarsini is a member of GNAMPA-INdAM. He gratefully acknowledges the support and hospitality of FONDECYT 1130564 and N?cleo Milenio ?Informaci?n y Coordinaci?n en Redes ?.
Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2019/1/15
Y1 - 2019/1/15
N2 - 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.
AB - 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.
KW - High congestion
KW - Nonatomic routing games
KW - Parallel networks
KW - Price of Anarchy
KW - Regularly varying functions
KW - Wardrop equilibrium
UR - http://www.scopus.com/inward/record.url?scp=85039984458&partnerID=8YFLogxK
U2 - 10.1007/s00224-017-9834-1
DO - 10.1007/s00224-017-9834-1
M3 - Article
AN - SCOPUS:85039984458
VL - 63
SP - 90
EP - 113
JO - Theory of Computing Systems
JF - Theory of Computing Systems
SN - 1432-4350
IS - 1
ER -