Ramesh Johari

Print

Research

Teaching

Activities

Lecture Notes

MS&E 246: Game Theory with Engineering Applications

These are lecture notes from the Winter 2007 edition of the course.

Lecture 1: Introduction
Lecture 2: The basics
Lecture 3: Pure strategy Nash equilibrium
Lecture 4: Mixed strategies
Lecture 5: Efficiency and fairness
Lecture 6: Dynamic games of complete and perfect information
Lecture 7: Stackelberg games
Lecture 8: Dynamic games of complete and imperfect information
Lecture 9: Sequential bargaining
Lecture 10: Repeated games
Lecture 11: Concluding remarks on subgame perfection
Lecture 12: Static games of incomplete information
Lecture 13: Auctions: Incomplete information
Lecture 14: Auctions: Examples
Lecture 15: Perfect Bayesian equilibrium
Lecture 16: Signaling games
Lecture 17: Network routing I
Lecture 18: Network routing II

MS&E 336: Dynamics and Learning in Games

These are lecture notes from the Spring 2007 edition of the course.

Lecture 1: Dynamic games
Lecture 2: A sequential entry game
Lecture 3: Reputation and payoff bounds
Lecture 4: Stochastic games
Lecture 6: Fictitious play
Lecture 7: Fictitious play--examples and convergence
Lecture 8: Supermodular games
Lecture 9: Adaptive learning
Lecture 10: Learning in games
Lecture 11: The multiplicative weights algorithm
Lecture 13: Blackwell's approachability theorem
Lecture 14: Approachability and regret minimization
Lecture 15: Calibration

Page last modified on January 01, 2011, at 04:39 PM