'The Japan Society for Industrial and Applied Mathematics'
Abstract
We study the asymmetric atomic selfish routing in ring networks, which has diverse practical applications in network design and analysis. We are concerned with minimizing the maximum latency of source-destination node-pairs over links with linear latencies. We obtain the first constant upper bound on the price of anarchy and significantly improve the existing upper bounds on the price of stability. Moreover, we show that any optimal solution is a good approximate Nash equilibrium. Finally, we present better performance analysis and fast implementation of pseudo-polynomial algorithms for computing approximate Nash equilibria
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.