LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Lecture 5: Nash Equilibrium
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Lecture 5: Nash Equilibrium

79 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Economic Applications of Game Theory · LECTURE 5

Ian Ball teaches this session of MIT's 14.12 Economic Applications of Game Theory, working through the concept of Nash equilibrium, the state in which every player is playing a best response to everyone else so no one benefits from switching strategy alone. He builds the idea through concrete examples, including two friends deciding between attending a Celtics game or a Red Sox game and a hide-and-seek matchup, using both to show how equilibrium concepts apply to everyday coordination and conflict problems. The lecture also covers mixed strategies, explaining why players sometimes need to randomize their choices to keep opponents from predicting their behavior. Running just over an hour, the session is blackboard-based and builds formal definitions step by step from the examples rather than starting with abstract notation.

More from this course

12 LECTURES
Introduction to Individual Decision-Making

Introduction to Individual Decision-Making

MIT · 57 MIN
Representation of Games

Representation of Games

MIT · 73 MIN
Lecture 3: Dominance

Lecture 3: Dominance

MIT · 76 MIN
Lecture 4: Rationalizability

Lecture 4: Rationalizability

MIT · 82 MIN
Imperfect Competition

Imperfect Competition

MIT · 81 MIN
Zero-Sum Games

Zero-Sum Games

MIT · 81 MIN
Lecture 8: Backward Induction

Lecture 8: Backward Induction

MIT · 77 MIN
Lecture 9: Negotiation

Lecture 9: Negotiation

MIT · 74 MIN
Lecture 10: Subgame-Perfect Nash Equilibrium

Lecture 10: Subgame-Perfect Nash Equilibrium

MIT · 81 MIN
One-Shot Deviation Principle and Bargaining

One-Shot Deviation Principle and Bargaining

MIT · 78 MIN
Lecture 12: Finitely Repeated Games

Lecture 12: Finitely Repeated Games

MIT · 77 MIN
Lecture 13: Infinitely Repeated Games

Lecture 13: Infinitely Repeated Games

MIT · 82 MIN