The final lecture in the introductory week of the course.

The third lecture in the first week of the course.

This is the second lecture in Cooperation and Competition. We covered more content in Chapters 1 and 2 of Dixit, Skeath and Reiley: commitment devices, the prisoner's dilemma, randomization, among others. We also had to do some basic administration at the beginning of the lecture.

In this lecture we continued with the working out how to solve sequential games. We examined the idea of subgame perfect equilibrium and applied the solution method of Zermelo's Algorithm to several games to find the subgame perfect equilibria of these games.

In this lecture we began the chapter on sequential games. We began the lecture with a clip from Chris Nolan's 'The Dark Knight' and proceeded to look at the basic theory of sequential games: game trees, decision nodes, subgames, strategies, etc. We ended the lecture after looking at the example of the prisoner's dilemma in extensive form.