Главная
Study mode:
on
1
Introduction
2
MinMax Theorem
3
Historical Facts
4
Convergence
5
Implicit Methods
6
Proof
7
Color coding
8
Inner product analysis
9
Average case convergence
10
Unconstrained settlement
11
Multiplayer games
12
polynomial type games
13
mixed strategies
14
More practical algorithms
Description:
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.

Min-Max Optimization - Part II

Simons Institute
Add to list
0:00 / 0:00