"Lec 24- Asymmetric information: auctions and the winner's curse" Game Theory (ECON 159) We discuss auctions. We first distinguish two extremes: common values and private values. We hold a common value auction in class and discover the winner's curse, the winner tends to overpay. We discuss why this occurs and how to avoid it: you should bid as if you knew that your bid would win; that is, as if you knew your initial estimate of the common value was the highest. This leads you to bid much below your initial estimate. Then we discuss four forms of auction: first-price sealed-bid, second-price sealed-bid, open ascending, and open descending auctions. We discuss bidding strategies in each auction form for the case when values are private. Finally, we start to discuss which auction forms generate higher revenues for the seller, but a proper analysis of this will have to await the next course. 00:00 - Chapter 1. Auctions: Common versus Private Values 08:16 - Chapter 2. Auctions: Winner's Curse in the First-Price Sealed-Bid Auction 42:38 - Chapter 3. Auctions: Other Types of Auction 58:35 - Chapter 4. Auctions: Revenue Generation in Different Types of Auctions Complete course materials are available at the Open Yale Courses website: http://open.yale.edu/courses This course was recorded in Fall 2007.
Video is embedded from external source so embedding is not available.
Video is embedded from external source so download is not available.
Channels: Others
Tags: ascending price auction auctions common value descending Nash equilibrium private revenue equivalence theorem
Uploaded by: yalegametheory ( Send Message ) on 02-09-2012.
Duration: 62m 29s
No content is added to this lecture.
This video is a part of a lecture series from of Yale
Lec 1 - Introduction: five first lessons
Lec 2 - Putting yourselves into other people's shoes
Lec 3 - Iterative deletion and the median-voter theorem
Lec 4 - Best responses in soccer and business partnerships
Lec 5 - Nash equilibrium: bad fashion and bank runs
Lec 6 - Nash equilibrium: dating and Cournot
Lec 7 - Nash equilibrium: shopping, standing and voting on a line
Lec 8 - Nash equilibrium: location, segregation and randomization
Lec 9 - Mixed strategies in theory and tennis
Lec 10 - Mixed strategies in baseball, dating and paying your taxes
Lec 11 - Evolutionary stability: cooperation, mutation, and equilibrium
Lec 12 - Evolutionary stability: social convention, aggression, and cycles
Lec 13 - Sequential games: moral hazard, incentives, and hungry lions
Lec 14 - Backward induction: commitment, spies, and first-mover advantages
Lec 15 - Backward induction: chess, strategies, and credible threats
Lec 16 - Backward induction: reputation and duels
Lec 17 - Backward induction: ultimatums and bargaining
Lec 18 - Imperfect information: information sets and sub-game perfection
Lec 19 - Subgame perfect equilibrium: matchmaking and strategic investments
Lec 20 - Subgame perfect equilibrium: wars of attrition
Lec 21 - Repeated games: cooperation vs. the end game
Lec 22 - Repeated games: cheating, punishment, and outsourcing
Lec 23 - Asymmetric information: silence, signaling and suffering education