i, the valuation of the object is uniformly distributed on [0,1]. The valuations of the two bidders are independent. Each bidder knows her own valuation, but not the valuation of the other bidder. The bidders simultaneously submit bids b € [0, ∞), and whoever submits the higher bid wins the object and pays the average of the two bids. In case of a tie, each bidder wins the object with probability 1/2 and again the winner pays the average of the two bids. Find a Nash equilibrium of this game in which each bidder's strategy is linear in her valuation. Solution: Look for a symmetric equilibrium where each player bids according to b(v) = av+c. First note that in equilibrium, b(0) = 0 since otherwise types with valuations just above 0 win with positive probability and pay more than their valuation, and hence would prefer to lower their bids. Hence e=0. For every valuation vi for player 1, v₁ = must solve max Pr(b₂ < b(v')) (v₁ − 1 (b(v¹) + E [b(v₂) | v2 < v′])) . de[0,1] We have Pr(b₂ < b(v')) = Pr(v₂ < v') = v'. Moreover, since b(v₂) is linear and b(0) = 0, E [b(v₂) | v¹₂ < v′] = b(v¹)/2. Substituting and differentiating leads to the first-order condition - ²b(v) - vb¹(v) = 0, which is solved for all v if a = 2/3. There is a symmetric NE in which both players use the strategy b(v) = 2v/3.

ENGR.ECONOMIC ANALYSIS
14th Edition
ISBN:9780190931919
Author:NEWNAN
Publisher:NEWNAN
Chapter1: Making Economics Decisions
Section: Chapter Questions
Problem 1QTC
icon
Related questions
Question

please  if you can teach explain 

Two bidders compete in a sealed-bid auction for a single indivisible object. For each bidder
i, the valuation of the object is uniformly distributed on [0,1]. The valuations of the two
bidders are independent. Each bidder knows her own valuation, but not the valuation of
the other bidder. The bidders simultaneously submit bids b € [0, 0), and whoever submits
the higher bid wins the object and pays the average of the two bids. In case of a tie, each
bidder wins the object with probability 1/2 and again the winner pays the average of the two
bids. Find a Nash equilibrium of this game in which each bidder's strategy is linear in her
valuation.
Solution: Look for a symmetric equilibrium where each player bids according to b(v) = av+c.
First note that in equilibrium, b(0) = 0 since otherwise types with valuations just above 0 win
with positive probability and pay more than their valuation, and hence would prefer to lower
their bids. Hence e=0. For every valuation vi for player 1, v₁ = must solve
max_ Pr(b2 < b(v')) (v₁ − ½ (b(v¹) + E [b(v2) | v2 < v′])) .
We have Pr(b₂ <b(v¹)) = Pr(v₂ < v¹) = v'. Moreover, since b(v₂) is linear and b(0) = 0,
E[b(v₂) | 1¹₂ < v²] = b(r)/2. Substituting and differentiating leads to the first-order condition
- ³²b(v) — ²/vb'(v) = 0,
which is solved for all v if a = 2/3. There is a symmetric NE in which both players use the
strategy b(v) = 2v/3.
Transcribed Image Text:Two bidders compete in a sealed-bid auction for a single indivisible object. For each bidder i, the valuation of the object is uniformly distributed on [0,1]. The valuations of the two bidders are independent. Each bidder knows her own valuation, but not the valuation of the other bidder. The bidders simultaneously submit bids b € [0, 0), and whoever submits the higher bid wins the object and pays the average of the two bids. In case of a tie, each bidder wins the object with probability 1/2 and again the winner pays the average of the two bids. Find a Nash equilibrium of this game in which each bidder's strategy is linear in her valuation. Solution: Look for a symmetric equilibrium where each player bids according to b(v) = av+c. First note that in equilibrium, b(0) = 0 since otherwise types with valuations just above 0 win with positive probability and pay more than their valuation, and hence would prefer to lower their bids. Hence e=0. For every valuation vi for player 1, v₁ = must solve max_ Pr(b2 < b(v')) (v₁ − ½ (b(v¹) + E [b(v2) | v2 < v′])) . We have Pr(b₂ <b(v¹)) = Pr(v₂ < v¹) = v'. Moreover, since b(v₂) is linear and b(0) = 0, E[b(v₂) | 1¹₂ < v²] = b(r)/2. Substituting and differentiating leads to the first-order condition - ³²b(v) — ²/vb'(v) = 0, which is solved for all v if a = 2/3. There is a symmetric NE in which both players use the strategy b(v) = 2v/3.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Risk Aversion
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, economics and related others by exploring similar questions and additional content below.
Recommended textbooks for you
ENGR.ECONOMIC ANALYSIS
ENGR.ECONOMIC ANALYSIS
Economics
ISBN:
9780190931919
Author:
NEWNAN
Publisher:
Oxford University Press
Principles of Economics (12th Edition)
Principles of Economics (12th Edition)
Economics
ISBN:
9780134078779
Author:
Karl E. Case, Ray C. Fair, Sharon E. Oster
Publisher:
PEARSON
Engineering Economy (17th Edition)
Engineering Economy (17th Edition)
Economics
ISBN:
9780134870069
Author:
William G. Sullivan, Elin M. Wicks, C. Patrick Koelling
Publisher:
PEARSON
Principles of Economics (MindTap Course List)
Principles of Economics (MindTap Course List)
Economics
ISBN:
9781305585126
Author:
N. Gregory Mankiw
Publisher:
Cengage Learning
Managerial Economics: A Problem Solving Approach
Managerial Economics: A Problem Solving Approach
Economics
ISBN:
9781337106665
Author:
Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor
Publisher:
Cengage Learning
Managerial Economics & Business Strategy (Mcgraw-…
Managerial Economics & Business Strategy (Mcgraw-…
Economics
ISBN:
9781259290619
Author:
Michael Baye, Jeff Prince
Publisher:
McGraw-Hill Education