Lecture

Game Theory: Minimax Theorem

In course

This course is an introduction to linear and discrete optimization. Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to p

Description

This lecture covers the concept of zero-sum games in Game Theory, focusing on the minimax theorem and the strategies to maximize or minimize expected values. The instructor explains the process of finding optimal strategies and the proof of the minimax theorem using linear programming. The lecture emphasizes the importance of choosing strategies to achieve the best outcomes in competitive scenarios.

Instructors (3)

Friedrich Eisenbrand

Friedrich Eisenbrand's main research interests lie in the field of discrete optimization, in particular in algorithms and complexity, integer programming, geometry of numbers, and applied optimization. He is best known for his work on efficient algorithms for integer programming in fixed dimension and the theory of cutting planes, which are an important tool to solve large scale industrial optimization problems in practice. Before joining EPFL in March 2008, Friedrich Eisenbrand was a full professor of mathematics at the University of Paderborn. Friedrich received the Heinz Maier-Leibnitz award of the German Research Foundation (DFG) in 2004 and the Otto Hahn medal of the Max Planck Society in 2001.

Rom Pinchasi

Official source

Related lectures (32)

Separating Hyperplanes: Theory and Applications

Explores separating hyperplanes for two sets X and Y, discussing conditions for separation and implications of convexity.

Convex Polyhedra and Linear Programs

Explores convex polyhedra, linear programs, and their optimization importance.

Linear Programming: Extreme Points

Explores extreme points in linear programming and the role of constraints in finding optimal solutions.

Linear Programming Duality

Explores the concept of duality in linear programming and its practical implications in optimization.

Linear Programming Basics

Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.