Higher mathematics: game theory

About the course

Normal-form games: payoff matrix, dominance and iterated elimination, Nash equilibrium in pure strategies, Pareto optimality, the prisoner's dilemma and other classic games. Mixed strategies and the indifference principle. Zero-sum games: maximin and minimax, saddle point, mixed solutions of 2×2 and 2×n games. Extensive-form games: game tree, backward induction, subgame perfect equilibrium, Cournot and Stackelberg duopolies. Repeated games: finite repetition, discounting, trigger strategy. Cooperative games: characteristic function, Shapley value, core. First-price and second-price auctions. Evolutionarily stable strategies, "Hawk-Dove", replicator dynamics. A continuation of probability theory and linear algebra.

Course program: 33 lessons

Normal-form games

  1. Normal-form game
  2. Dominance
  3. Nash equilibrium
  4. Pareto and classic games
  5. Checkpoint: normal-form games

Mixed strategies

  1. Mixed strategies
  2. 2×2 mixed equilibrium
  3. Checkpoint: mixed strategies

Zero-sum games

  1. Zero-sum games: maximin
  2. Saddle point and value of the game
  3. 2×2 mixed solution
  4. 2×n games: the graphical method
  5. Checkpoint: zero-sum games

Dynamic games

  1. Extensive-form games
  2. Backward induction
  3. Subgame perfect equilibrium
  4. Cournot duopoly
  5. Stackelberg model
  6. Checkpoint: dynamic games

Repeated games

  1. Repeated games
  2. Infinite repetition and discounting
  3. Checkpoint: repeated games

Cooperative games and auctions

  1. Coalitions and the characteristic function
  2. Shapley value
  3. Core of a cooperative game
  4. First-price and second-price auctions
  5. Equilibrium bids in an auction
  6. Checkpoint: cooperative games and auctions

Evolutionary games

  1. Evolutionarily stable strategy
  2. Hawk-Dove
  3. Replicator dynamics
  4. Checkpoint: evolutionary games

Final test

  1. Final test on game theory