A Second Course in Algorithms (Lecture 10: The Minimax Theorem & Algorithms for Linear Programming)

The minimax theorem for two-player zero-sum games. Survey of algorithms for linear programming: the simplex method, the ellipsoid method, and interior point methods. Full course playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RJh2yDxlJJjnKswWdoO8gAc Lecture notes: http://timroughgarden.org/w16/l/l10.pdf