Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Question 1 Consider the auction of a single indivisible object to two risk neutral bidders, each of whom receives a private signal X, (ic {1,2])
Question 1 Consider the auction of a single indivisible object to two risk neutral bidders, each of whom receives a private signal X, (ic {1,2]) which is independently and uniformly distributed on the interval [1,3]. Suppose bidders have a common value V where V = X1 + X2. 1. Illustrate the Winner's curse in the context of this example and second price auctions. In particular, if all bidders bid "naively" are there values of a bidder's signal for which a bidder experiences "expected" losses? 2. Let the bidding function b (x) = fx define a symmetric equilibrium of the second price auction. Derive the value of B. To help you out, you are advised to structure your answer in accordance with the fol- lowing format: . Fixing her opponent's strategy, express the expected payoff for one player when she has received signal x and bids as if she has received signal y. Your answershould take the form U(x, y) = [, x(x, y,a)f(alda, where a is the opponent's signal, f(a) is its density, and a(x, y, a) is the player's realized payoff given x, y, a. . For the next step you will need to differentiate the expected utility with respect to the bid y. Here you may find it useful to recall the rule for differentiating an integral: # [, G(a, z)da = G(a, Z)lazz + So #G(a, z)da. . Specify a first order condition that needs to be satisfied, and use it to solve for B. Briefly explain why this is a sensible step to be taking. 3. Now let the bidding function b (x) = yx define a symmetric equilibrium of the first price auction. Derive the value of y
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored 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