Question

Consider a first-price sealed-bid auction as the one analyzed in class. Suppose bidders' valuations are v1=10...

Consider a first-price sealed-bid auction as the one analyzed in class. Suppose bidders' valuations are v1=10 and v2=10. Suppose bidder 2 submits a bid b2=10. Then, in a Nash equilibrium in pure strategies bidder 1 must be submitting a bid equal to __ . In this Nash equilibrium, bidder 1's payoff is equal to __ (please, enter numerical values only, for example: 4).

Homework Answers

Answer #1

We have an information that bid for bidder 2 is $10 & valuation for bidder 2 is $10 hence the payoff for bidder 2 is 0 (Valuation - Bid) if he wins the bid.

For bidder 1 if he bids $10 that is equivalent to its valuation $10 then both bids match and auctioned product will be divided equally between them. Payoff for both the players is -5. For a bid less than $10 payoff for player 1 is 0 and for a bid more than $10 and less than $15 can have a payoff of - 1 to -4 respectively as he wins the bid of $10.

Hence bidder 1 bids from.$0 to $9 he doesnt win the bid hence nothing to pay therefore payoff is 0

As per my understanding Nash equilibrium for player 1 is $0. Payoff is $0

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider a first-price sealed-bid auction. Suppose bidders' valuations are v1=10 and v2=10. Suppose bidder 2 submits...
Consider a first-price sealed-bid auction. Suppose bidders' valuations are v1=10 and v2=10. Suppose bidder 2 submits a bid b2=10. Then, in a Nash equilibrium in pure strategies bidder 1 must be submitting a bid equal to ______. In this Nash equilibrium, bidder 1's payoff is equal to ______. Please explain!!
Find a Nash Equilibrium of the second price sealed bid auction that is different from [v1,...
Find a Nash Equilibrium of the second price sealed bid auction that is different from [v1, v2, 0, ....0]
Consider 45 risk-neutral bidders who are participating in a second-price, sealed-bid auction. It is commonly known...
Consider 45 risk-neutral bidders who are participating in a second-price, sealed-bid auction. It is commonly known that bidders have independent private values. Based on this information, we know the optimal bidding strategy for each bidder is to: A. bid their own valuation of the item. B. shade their bid to just below their own valuation. C. bid according to the following bid function: b = v − (v − L)/n. D. bid one penny above their own valuation to ensure...
Suppose that we have the following auction scheme. There are two bidders, and an item to...
Suppose that we have the following auction scheme. There are two bidders, and an item to be allocated to them. Each bidder submits a bid. The highest bidder gets the good, but both bidders pay their bids. Consider the case in which bidder 1 values the item at 3, while bidder 2 values the item at 5; this is commonly known. Each bidder can only submit one of three bids: 0, 1 or 2. If player i bids more than...
Consider an auction where n identical objects are offered and there are n+ 1 bidders. The...
Consider an auction where n identical objects are offered and there are n+ 1 bidders. The true value of each object is the same for all bidders and for all objects but each bidder gets only an independent unbiased estimate of this common value. Bidders submit sealed bids and the top n bidders get one object each and each pays her own bid. Suppose you lose. What conclusion might you draw from losing? How will this affect your bidding strategy?...