Journal
ALGORITHMIC GAME THEORY, SAGT 2016
Volume 9928, Issue -, Pages 117-128Publisher
SPRINGER INT PUBLISHING AG
DOI: 10.1007/978-3-662-53354-3_10
Keywords
-
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available