TY - GEN
T1 - On the price of anarchy of highly congested nonatomic network games
AU - Colini-Baldeschi, Riccardo
AU - Cominetti, Roberto
AU - Scarsini, Marco
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2016.
PY - 2016
Y1 - 2016
N2 - We consider nonatomic network games with one source and one destination. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some empirical observations, we show that, under suitable conditions, the price of anarchy is asymptotic to one. We show with some counterexamples that this is not always the case. The counterexamples occur in simple parallel graphs.
AB - We consider nonatomic network games with one source and one destination. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some empirical observations, we show that, under suitable conditions, the price of anarchy is asymptotic to one. We show with some counterexamples that this is not always the case. The counterexamples occur in simple parallel graphs.
UR - http://www.scopus.com/inward/record.url?scp=84987968044&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-53354-3_10
DO - 10.1007/978-3-662-53354-3_10
M3 - Conference contribution
AN - SCOPUS:84987968044
SN - 9783662533536
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 117
EP - 128
BT - Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings
A2 - Gairing, Martin
A2 - Savani, Rahul
PB - Springer Verlag
T2 - 9th International Symposium on Algorithmic Game Theory, SAGT 2016
Y2 - 19 September 2016 through 21 September 2016
ER -