Skip to content

Settling the complexity of computing approximate two-player Nash equilibria - Nash equilibria

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

Addresses the computational complexity of finding approximate Nash equilibria in two-player games, a central problem in algorithmic game theory. Teaching foundational complexity results in game theory.

Video by Institute for Advanced Study, played through YouTube's embedded player.