| |
|
Game Theory 101 MOOC (#1): Introduction
|
| | |
| |
|
Game Theory 101 MOOC (#2): The Prisoner's Dilemma and Strict Dominance
|
| | |
| |
|
Game Theory 101 MOOC (#3): Iterated Elimination of Strictly Dominated Strategies
|
| | |
| |
|
Game Theory 101 MOOC (#4): Pure Strategy Nash Equilibrium and the Stag Hunt
|
| | |
| |
|
Game Theory 101 MOOC (#5): What Is a Nash Equilibrium?
|
| | |
| |
|
Game Theory 101 MOOC (#6): Best Responses
|
| | |
| |
|
Game Theory 101 MOOC (#7): Mixed Strategy Nash Equilibrium and Matching Pennies
|
| | |
| |
|
Game Theory 101 MOOC (#8): The Mixed Strategy Algorithm
|
| | |
| |
|
Game Theory 101 MOOC (#9): How NOT to Write a Mixed Strategy Nash Equilibrium
|
| | |
| |
|
Game Theory 101 MOOC (#10): Battle of the Sexes
|
| | |
| |
|
Game Theory 101 MOOC (#11): Calculating Payoffs
|
| | |
| |
|
Game Theory 101 MOOC (#12): Strict Dominance in Mixed Strategies
|
| | |
| |
|
Game Theory 101 MOOC (#13): Weak Dominance
|
| | |
| |
|
Game Theory 101 MOOC (#14): Infinitely Many Equilibria
|
| | |
| |
|
Game Theory 101 MOOC (#15): The Odd Rule
|
| | |
| |
|
Game Theory 101 MOOC (#16): Subgame Perfect Equilibrium
|
| | |
| |
|
Game Theory 101 MOOC (#17): Backward Induction
|
| | |
| |
|
Game Theory 101 MOOC (#18): How NOT to Write a Subgame Perfect Equilibrium
|
| | |
| |
|
Game Theory 101 MOOC (#19): Multiple Subgame Perfect Equilibria
|
| | |
| |
|
Game Theory 101 MOOC (#20): Games with Stages
|
| | |
| |
|
Game Theory 101 MOOC (#21): Punishment Strategies
|
| | |
| |
|
Game Theory 101 MOOC (#22): Tying Hands (Burning Bridges)
|
| | |
| |
|
Game Theory 101 MOOC (#23): Commitment Problems
|
| | |
| |
|
Game Theory 101 MOOC (#24): The Centipede Game
|
| | |
| |
|
Game Theory 101 MOOC (#25): Problems with Backward Induction
|
| | |
| |
|
Game Theory 101 MOOC (#26): Forward Induction
|
| | |
| |
|
Game Theory 101 MOOC (#27): Probability Distributions
|
| | |
| |
|
Game Theory 101 MOOC (#28): Generalized Battle of the Sexes
|
| | |
| |
|
Game Theory 101 MOOC (#29): Knife-Edge Equilibria
|
| | |
| |
|
Game Theory 101 MOOC (#30): Soccer Penalty Kicks
|
| | |
| |
|
Game Theory 101 (#30.5): Establishing Causation
|
| | |
| |
|
Game Theory 101 MOOC (#31): Comparative Statics
|
| | |
| |
|
Game Theory 101 MOOC (#32): The Support of Mixed Strategies
|
| | |
| |
|
Game Theory 101 MOOC (#33): A Trick with Weak Dominance
|
| | |
| |
|
Game Theory 101 MOOC (#34): Rock Paper Scissors
|
| | |
| |
|
Game Theory 101 MOOC (#35): Symmetric, Zero Sum Games
|
| | |
| |
|
Game Theory 101 MOOC (#36): Modified Rock Paper Scissors
|
| | |
| |
|
Game Theory 101 MOOC (#37): Mixing among Three Strategies
|
| | |
| |
|
Game Theory 101 MOOC (#38): A Game with No Equilibria
|
| | |
| |
|
Game Theory 101 MOOC (#39): Duels
|
| | |
| |
|
Game Theory 101 MOOC (#40): Hotelling's Game and the Median Voter Theorem
|
| | |
| |
|
Game Theory 101 MOOC (#41): Second Price Auctions
|
| | |
| |
|
Game Theory 101 (#42): Expected Utility Theory
|
| | |
| |
|
Game Theory 101 (#43): Completeness
|
| | |
| |
|
Game Theory 101 (#44): Transitivity
|
| | |
| |
|
Game Theory 101 (#45): Rationality
|
| | |
| |
|
Game Theory 101 (#46): Condorcet's Paradox and Social Preferences
|
| | |
| |
|
Game Theory 101 (#47): Lotteries
|
| | |
| |
|
Game Theory 101 (#48): Independence over Lotteries
|
| | |
| |
|
Game Theory 101 (#49): The Allais Paradox
|
| | |
| |
|
Game Theory 101 (#50): Continuity
|
| | |
| |
|
Game Theory 101 (#51): Expected Utility Transformations
|
| | |
| |
|
Game Theory 101 (#52): Pareto Efficiency
|
| | |
| |
|
Game Theory 101 (#53): Risk Averse, Risk Neutral, and Risk Acceptant Preferences
|
| | |
| |
|
Game Theory 101 (#54): Repeated Prisoner's Dilemma (Finite)
|
| | |
| |
|
Game Theory 101 (#55): Discount Factors
|
| | |
| |
|
Game Theory 101 (#56): Geometric Series and Infinite Payoffs
|
| | |
| |
|
Game Theory 101 (#57): The One-Shot Deviation Principle
|
| | |
| |
|
Game Theory 101 (#58): Grim Trigger in the Repeated Prisoner's Dilemma
|
| | |
| |
|
Game Theory 101 (#59): Tit-for-Tat in the Repeated Prisoner's Dilemma
|
| | |
| |
|
Game Theory 101 (#60): Tit-for-Tat Isn't Subgame Perfect
|
| | |
| |
|
Game Theory 101 (#61): The Folk Theorem
|
| | |
| |
|
Game Theory 101 (#62): Repeated Games and the Prediction Problem
|
| | |
| |
|
Game Theory 101 (#63): Incomplete Information
|
| | |
| |
|
Game Theory 101 (#64): Bayesian Nash Equilibrium
|
| | |
| |
|
Game Theory 101 (#65): Solving for Bayesian Nash Equilibrium
|
| | |
| |
|
Game Theory 101 (#66): Ex Ante and Interim Dominance
|
| | |
| |
|
Game Theory 101 (#67): Why Are There Antes in Poker?
|
| | |
| |
|
Game Theory 101 (#68): Is More Information Always Better?
|
| | |