Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
On Convex Optimization covers course organization, mathematical optimization problems, solution concepts, and optimization methods.
