Lecture 24 - Asymmetric information: auctions and the winner's curse
recorded by: Yale University
published: Nov. 15, 2010, recorded: September 2007, views: 2999
released under terms of: Creative Commons Attribution No Derivatives (CC-BY-ND)
See Also:
Download yaleecon159f07_polak_lec24_01.mov (Video - generic video source 520.1 MB)
Download yaleecon159f07_polak_lec24_01.flv (Video 225.6 MB)
Download yaleecon159f07_polak_lec24_01_640x360_h264.mp4 (Video 186.9 MB)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
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.
Reading assignment:
Strategies and Games: Theory And Practice. (Dutta): Chapters 19-21
Strategy: An Introduction to Game Theory. (Watson): Chapters 24, 29
Resources:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: