
In this class the main components of a game will be illustrated, by looking at a first game matrix, that of the prisoners' dilemma.
In this class, the prisoners' dilemma will be introduced in detail.
This class will introduce the notion of equilibrium, and in particular that of Nash equilibrium in pure strategies.
In this class we'll find a Nash equilibrium for the prisoners' dilemma.
This class introduces another well known game, the battle of sex, and finds its two Nash equilibria.
For this "zero sum" game, matching pennies, we'll discover there does not exist any nash equilibrium in pure strategies. We need, therefore, to enlarge our notion of equilibrium.
This class introduces the notion of mixed strategies Nash equilibria.
Step by step, we compute an equilibrium in mixed strategies for the game of matching pennies.
This class offfers an interpretation for mixed strategy equilibria, and computes a Nash equilibrium in mixed strategies for the battle of sexes.
This class shows that no mixed strategy Nash equilibrium exists in the case of the prisoners' dilemma.
This class introduces the "game of chicken" and finds pure and mixed strategy equilibria for it. How likely is a crash to happen?
This class introduces the notion of dominated strategies, and explains how to reduce the set of Nash equilibria by eliminating such strategies.
In this class we reduce the set of equilibria in a game by iteratedly eliminating (weakly) dominated strategies.
This class explains why the pure strategy Nash equilibrium for the prisoners' dilemma is so strong, by showing it is an equilibrium in dominant strategies.
This class introduces a new way of representing games, the extensive form.
This class introduces the concept of subgame perfect equilibrium for sequential games. One such equilibrium is computed for a simple game, and compared to the equilibria of the corresponding simultaneous game.
In this class we discuss the notion of repeated games, and illustrate its possible implications for the prisoners' dilemma.
In this class we introduce Cournot duopoly, as we want to show that its equilibrium is in fact an instance of a Nash equilibrium.
This class shows that a Cournot equilibrium is in fact a Nash equilibrium, and casts the relationship between a Cournot and a Cartel equilibrium in the framework of the prisoners' dilemma.
This class shows that the equilibrium of a Stackelberg duopoly is just an instance of a subgame perfect equilibrium for a sequential game.
This course introduces the main concepts of non cooperative game theory by using a hands-on approach, i.e. by presenting, discussing and solving examples.
Some well known normal form games, such as matching pennies, the prisoners' dilemma, the battle of sexes, and the game of chicken, will be discussed to introduce and apply concepts like Nash equilibrium in pure and mixed strategies, the elimination of dominated strategies, and repeated games.
Sequential games will also be described, by using an extensive form based on game trees. The notion of subgame perfect equilibrium will consequently be discussed.
Finally, some game tehoretical concepts will be used to describe the outcome of Cournot and Stackelberg duopoly, and the instability of a cartel.