Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Question 2 Consider a sealed-bid second price auction with three bidders. The seller has a value 0 for the object. Each bidder has a value
Question 2 Consider a sealed-bid second price auction with three bidders. The seller has a value 0 for the object. Each bidder has a value drawn from the uniform distribution F(v) = v on [0, 1], i.e., the probability that his value is less than :c is just :0. a. Given that the highest bidder has a value UH , you know how to calculate the expected value UL of the second-highest bidder, conditional on this value being less than 12H. Use this to calculate the expected revenue of the seller. b. Now suppose the seller can also submit a bid 7', which is his \"reservation bid\". If the highest bid is lower than r, then the object is not sold. If the highest bid is greater than r, then the highest bidder gets the object at a price equal to the larger of the other two bids, or 1', whichever is greater. For an arbitrary 1', what is the probability that: i. Both the highest and second highest bids exceed 1", ii. Exactly one buyer bids more than 1" (be careful, you need to count the probability that it is bidder 1 or bidder 2 or bidder 3), iii. All buyers bid less than 7'? c. From part b., calculate the sellers expected revenue for an arbitrary reserve value (you will have to think carefully about the revenue in case b i..) d. Find the revenue-maximising reserve. e. (Even if you cant solve the whole problem above) Provide some intuitive reasoning about whether the optimal reserve should be 0 or greater than 0. Suppose the seller sets a very small reserve, e.g., . Think of when he would lose and when he would gain, how much he would lose or gain, and the probabilities of these events
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started