Atomic routing games on maximum congestion

We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is the global maximum congestion over all edges in the network. We show that the price of stability is 1. The price of anarchy, P o A, is determined by topological properties of the network. In particular, P o A = O (ℓ + log n), where ℓ is the length of the longest path in the player strategy sets, and n is the size of the network. Further, κ - 1 ≤ P o A ≤ c (κ² + log² n), where κ is the length of the longest cycle in the network, and c is a constant.