| Week |
Sunday Lecture |
| 1 |
18/10/2009
Introduction to the course - background and motivation, quick review of game theory concepts (strategies, dominant strategies, Nash equilibrium) (153KB) |
| 2 |
25/10/2009
Game payoff, congestion games, potential games (149KB) |
| 3 |
01/11/2009
Selfish routing - bounding the price of anarchy (2.43MB) |
| 4 |
08/11/2009
Finding Nash Equilibrium - challenges and partial solutions (124KB) |
| 5 |
15/11/2009
Network construction games - bounding the price of anarchy and the price of stability (117KB) |
| 6 |
22/11/2009
How much time does it take to find a pure Nash equilibrium? Lower bounds (96KB) |
| 7 |
29/11/2009
Graphic representations and complexity of finding a Nash equilibrium, mixed strategies, the minmax theorem (136KB) |
| 8 |
06/12/2009
Proof of minmax theorem, applications of the theorem (141KB) |
| 9 |
Happy Hanukkah! |
| 10 |
20/12/2009
Alpha-Beta pruning, lower bounds on random algorithms (134KB) |
| 11 |
27/12/2009
Mixed equilibrium: definition and proof of existence (111KB) |
| 12 |
03/01/2010
Proof of the fixed point theorem, PPAD, correlated equilibrium (94KB) |
| 13 |
10/01/2010
Correlated equilibrium, regret minimization (98KB) |
| 14 |
17/01/2010
An algorithm with sublinear swap-regret (112KB) |
| |
All Lectures (3.74MB) |