The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands

摘要

By showing that there is an upper bound for the price of anarchy rho(Gamma) for a non-atomic congestion game Gamma with only separable cost maps and fixed demands, Roughgarden and Tardos show that the cost of forgoing centralized control is mild. This letter shows that there is an upper bound for rho(Gamma) in Gamma for fixed demands with symmetric cost maps. It also shows that there is a weaker bound for rho(Gamma) in Gamma with elastic demands. (C) 2003 Elsevier B.V. All rights reserved. [References: 13]