Nash equilibrium is the central solution concept in Game Theory.
In recent decades, its universality as a solution concept has come under a computational critique: Finding a Nash equilibrium is, in general, a computationally intractable problem [1]}, [2]}; and if centralized, specially designed algorithms cannot find an equilibrium, how can we expect decentralized, selfish agents to converge to one?
