Worst-Case Equilibria II: On Two Links with Speeds s₁ ≤ s₂ ≤ φs₁ Some Nash Equilibrium Has Expected Makespan 1 + s₂/(s₁ + s₂) Times the Optimum, Reaching φ at s₂ = φs₁Research Paper
When many independent users share a network, each routes its own traffic to minimize its own delay, and nobody optimizes the system as a whole. Koutsoupias and Papadimitriou asked how much this lack of coordination can cost: how far the social cost of a Nash equilibrium can be from the social optimum, in the worst case. Their paper Worst-case equilibria (STA…