Lesson 17: Algorithmic Lower Bounds by Mohammad Hajiaghayi: Hardness of Finding Nash Equilibria
Mohammad Hajiaghayi · 80:31
The lecture shows that Sperner's lemma, Brouwer's fixed point theorem and Nash equilibrium are equivalent in the sense that each can be derived from the next. Nash equilibrium is PPAD-complete because a game can be bu...