On the price of anarchy of highly congested nonatomic network games

Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

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.

Original languageEnglish
Title of host publicationAlgorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings
EditorsMartin Gairing, Rahul Savani
PublisherSpringer Verlag
Pages117-128
Number of pages12
ISBN (Print)9783662533536
DOIs
StatePublished - 2016
Event9th International Symposium on Algorithmic Game Theory, SAGT 2016 - Liverpool, United Kingdom
Duration: 19 Sep 201621 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9928 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Symposium on Algorithmic Game Theory, SAGT 2016
Country/TerritoryUnited Kingdom
CityLiverpool
Period19/09/1621/09/16

Fingerprint

Dive into the research topics of 'On the price of anarchy of highly congested nonatomic network games'. Together they form a unique fingerprint.

Cite this