Communication complexity of approximate Nash equilibria - Aviad Rubinstein

About this video

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

Analyzes communication complexity required to compute approximate Nash equilibria, a result bridging game theory and complexity theory. Teaching how communication bounds constrain game-theoretic computation.

A 63-minute video from Institute for Advanced Study: “Communication complexity of approximate Nash equilibria - Aviad Rubinstein”.

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