Sign in

Libre University uses your GitHub account. Signing in is only needed to sit a final test, so the score is kept on your profile.

Game Theory

Strategy when the best move depends on someone else's: dominance and equilibrium, repetition and reputation, bargaining, and where the predictions fail.

01

What a game is

Players, strategies and payoffs, the grid they form, and why the numbers written in it have to be utilities rather than money.

02

Dominance

The one prediction that needs no guess about what anyone believes, iterated until it stops, and the famous game where it gives a single unwelcome answer.

03

Nash equilibrium

Best responses, the profile at which every player is giving one, how to read equilibria off a grid, and the games where none exists.

04

Mixed strategies

Randomising to avoid being predicted, the indifference condition that fixes the probabilities, Nash's existence theorem, and why a harsher penalty does not reduce the crime.

05

Coordination and the selection problem

Games with several equilibria, the mixed equilibrium that is worse than all of them, and the arguments from outside the model that pick a winner.

06

Zero-sum games and minimax

Security levels, the gap between maximin and minimax, von Neumann's theorem closing it with mixing, and the one class of games with an unambiguous prediction.

07

Competing on quantity and price

Strategy sets that are intervals, best responses that are functions, the Cournot equilibrium solved from a parabola, and why price competition drives profit to zero.

08

Moving in sequence

Game trees, a strategy as a complete contingent plan, backward induction, and the first-mover advantage priced out in a quantity-setting duopoly.

09

Credible threats and commitment

Subgame perfection removes equilibria that rest on threats nobody would carry out, and shows why destroying your own options can be worth paying for.

10

Repetition and the shadow of the future

Why a known last round destroys cooperation, how a discount factor prices the future, and the patience threshold above which the prisoner's dilemma reverses.

11

The folk theorem

Repetition sustains almost any payoff above the minmax, so a result that explained cooperation ends up explaining everything, and the empirical reply is a tournament.

12

Splitting the surplus

Equilibrium accepts every division of a gain, so Nash imposed four properties on the answer instead, and they pin down exactly one split.

13

Bargaining by taking turns

Model the haggling instead of the outcome, and impatience alone fixes a unique split, reached immediately, that no laboratory subject plays.

14

Private information and auctions

Give each player a private type and a belief about everyone else's, then price a second-price bid, a first-price bid, and the cost of winning.

15

Where the predictions fail

The scorecard laid out honestly, the three models built to fit the failures, and the discipline that stops the theory absorbing every anomaly into the payoffs.

Final Test

The whole subject