Price of Anarchy for Highly Congested Routing Games in Parallel Networks
Sign Up to like & getrecommendations! Published in 2017 at "Theory of Computing Systems"
DOI: 10.1007/s00224-017-9834-1
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… read more here.
Keywords: highly congested; congested routing; price anarchy; routing games ... See more keywords