22. PPAD

preview_player
Показать описание
MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014
Instructor: Erik Demaine, Constantinos Daskalakis

In this first of two guest lectures by Prof. Constantinos Daskalakis of CSAIL, Daskalakis talks about the class PPAD, illustrating connections to economic game theory, topology, and graph theory.

License: Creative Commons BY-NC-SA
Рекомендации по теме
Комментарии
Автор

When I was watching this video, I suddenly found that the lecturer is just one of three authors of the paper where finding a Nash equilibrium is proved to be PPAD-complete. Fantastic!

梦帆马
Автор

Incredible person right here! Bravo Constantinos!

narutosaga