- 01Game Theory Intro (AGT 01)18m · +180 XP
- 02Von Neumann-Morgenstern Utility (AGT 02)20m · +200 XP
- 03Preference Aggregation (AGT 03)16m · +160 XP
- 04Predicting Actions with Dominance and Pure-Nash (AGT 04)15m · +150 XP
- 05Predicting Strategies with Mixed Nash Equilibria (AGT 05)22m · +220 XP
- 06Predicting Joint Behavior with Correlated Equilibria (AGT 06)19m · +190 XP
- 07Nash Approximation: ε-Equilibria (AGT 07)15m · +150 XP
- 08Nash Refinements: Trembling Hand and Evolutionary Stability (AGT 08)23m · +230 XP
- 09Equilibria with Pre-Commitment: Stackelberg & Coarse Correlated (AGT 09)18m · +180 XP
- 10Nash's Theorem: Every Game has an Equilibrium (AGT 10)23m · +230 XP
- 11Symmetric Games and Sperners Lemma (AGT 11)33m · +330 XP
- 12Nash Algorithm Starting Points (AGT 12)21m · +210 XP
- 13Finding Zero Sum Nash Equilibria with Linear Programming (AGT 13)16m · +160 XP
- 14Finding (Coarse) Correlated Equilibria with Linear Programming (AGT 14)17m · +170 XP
- 15Reductions and Why Zero Sum only Helps with Two Players (AGT 15)16m · +160 XP
- 16Complexity of Nash: PPAD (AGT 16)19m · +190 XP
- 17Fictitious Play and Regret Matching (AGT 17)13m · +130 XP
- 18Replicator Dynamics (AGT 18)14m · +140 XP
- 19Gradient Descent for Nash (AGT 19)10m · +100 XP
- 20Data Structures for Symmetric Games (AGT 20)24m · +240 XP
- 21Congestion Games (AGT 21)23m · +230 XP
- 22Action-Graph Games (AGT 22)19m · +190 XP
- 23Extensive Form Games (AGT 23)15m · +150 XP
- 24Subgame Perfection and Backwards Induction (AGT 24)22m · +220 XP
- 25Sequential (and Perfect Bayesian) Equilibrium (AGT 25)20m · +200 XP
- 26Counterfactual Regret Minimization (AGT 26)42m · +420 XP