Summary

Keywords

PPAD-complete graphical game polymatrix game 2-player game Handshaking Lemma PLS pigeonhole principle

Full Transcript

MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014 View the complete course: http://ocw.mit.edu/6-890F14 Instructor: Erik Demaine, Constantinos Daskalakis In the second of two guest lectures by Prof. Constantinos Daskalakis of CSAIL, Daskalakis talks about examples of PPAD-completeness reductions, as well as other classes related to PPAD. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

Ultimate Guide to Free Music Production Mastery

Unlock Your Musical Potential: Dive into our FREE Complete Music Production Course! Master the art of music creation, from software basics to advanced techniques—everything you need to produce professional-quality tracks. Start your musical journey today!

⭐ 4.9

12 ratings

9.5 hours