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.
On the Price of Anarchy of Highly Congested Nonatomic Network Games / COLINI BALDESCHI, Riccardo; Cominetti, Roberto; Scarsini, Marco. - 9928:(2016), pp. 117-128. [10.1007/978-3-662-53354-3_10]
On the Price of Anarchy of Highly Congested Nonatomic Network Games
COLINI BALDESCHI, RICCARDO;SCARSINI, MARCO
2016
Abstract
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
chp_10.1007_978-3-662-53354-3_10.pdf
Solo gestori archivio
Tipologia:
Versione dell'editore
Licenza:
DRM (Digital rights management) non definiti
Dimensione
257.39 kB
Formato
Adobe PDF
|
257.39 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
