The Price of Anarchy
Introduces the Price of Anarchy (PoA) as the ratio of the total system cost at user equilibrium to the total system cost at the system optimum, computes it from given costs and from latency functions, and discusses the 4/3 bound for affine latencies in routing games.
Tutorial
Introduction
The Price of Anarchy (PoA) measures how inefficient selfish routing is compared to centralized routing. For a given congestion game, let denote the total system cost at the user equilibrium and denote the total system cost at the system optimum. The Price of Anarchy is
Since the system optimum minimizes total cost by definition, , so . A value of means selfish routing happens to be optimal; a larger PoA means more system-wide efficiency is lost to selfish behavior.
For example, suppose the total delay across all flights on a city pair is aircraft-minutes under user-equilibrium routing, while a centralized flow manager could achieve aircraft-minutes. Then
so selfish routing produces more delay than is strictly necessary.