Algorithmic Game Theory (Lecture 13: Potential Games; A Hierarchy of Equilibria)
Tim Roughgarden Lectures · 71:02
Atomic selfish routing (and more generally congestion games) always has a pure Nash equilibrium because it is a potential game: a single potential \(\Phi\) tracks every unilateral cost change, so a global minimizer of...