Explore advanced concepts in min-max optimization in this lecture from the Learning and Games Boot Camp. Delve into the MinMax Theorem, historical facts, convergence, and implicit methods. Examine proofs using color coding and inner product analysis, and investigate average case convergence and unconstrained settlement. Learn about multiplayer games, polynomial type games, and mixed strategies. Gain insights into more practical algorithms for solving complex optimization problems in game theory and machine learning.
Overview
Syllabus
Introduction
MinMax Theorem
Historical Facts
Convergence
Implicit Methods
Proof
Color coding
Inner product analysis
Average case convergence
Unconstrained settlement
Multiplayer games
polynomial type games
mixed strategies
More practical algorithms
Taught by
Simons Institute
