Photo from archive.org
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.… Click to show full abstract
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.
Keywords:
highly congested;
congested routing;
price anarchy;
routing games;
anarchy highly;
price
Journal Title: Theory of Computing Systems
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Theory of Computing Systems
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!