Selfish unsplittable flows

What is the price of anarchy when unsplittable demands are routed selfishly in general networks with load-dependent edge delays? Motivated by this question we generalize the model of Koutsoupias and Papadimitriou (Worst-case equilibria, in: Proc. of the 16th Annual Symp. on Theoretical Aspects of Computer Science (STACS '99), Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, 1999, pp. 404-413) to the case of weighted congestion games. We show that varying demands of users crucially affect the nature of these games, which are no longer isomorphic to exact potential games, even for very simple instances. Indeed we construct examples where even a single-commodity (weighted) network congestion game may have no pure Nash equilibrium. On the other hand, we prove that any weighted network congestion game with linear edge delays admits a pure Nash equilibrium that can be found in pseudo-polynomial time. Finally, we consider the family of e-layered networks and give a surprising answer to the question above: the price of anarchy of any weighted congestion game in a e-layered network with in edges and edge delays equal to the loads is Theta(log m/ log log m). (c) 2005 Elsevier B.V. All rights reserved.