
Lecture 24 - Asymmetric Information: Auctions and the Winner's Curse
Jun 8, 2018 - 01:02:28
Radio and PodcastLive Radio & Podcasts
We first discuss Zermelo’s theorem: that games like tic-tac-toe or chess have a solution. That is, either there is a way for player 1 to force a win, or there is a way for player 1 to force a tie, or there is a way for p...
Lecture 15 - Backward Induction: Chess, Strategies, and Credible Threats is an episode from Yale Open Courses ECON 159: Game Theory by William Sheppard. We first discuss Zermelo’s theorem: that games like tic-tac-toe or chess have a solutio...
This episode belongs to Yale Open Courses ECON 159: Game Theory.
Use the player on this page to stream the episode online.
Published Jun 6, 2018, 01:12:38 long, audio available.