
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...