MANAGERIAL/ECON+BUS/STR CONNECT ACCESS
9th Edition
ISBN: 2810022149537
Author: Baye
Publisher: MCG
expand_more
expand_more
format_list_bulleted
Question
Chapter 12, Problem 6CACQ
(A)
To determine
The optimal bidding strategy in first price, sealed bid auction is to be ascertained.
(B)
To determine
The optimal bidding strategy in first price, sealed bid auction is to be ascertained.
(C)
To determine
The optimal bidding strategy in first price, sealed bid auction is to be ascertained.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
You are a bidder in an independent private auction, and you value the object at $2000. Each bidder assumes that the valuations are uniformly distributed between $1000 and $5000. Determine your optimal bidding strategy in a first-price sealed bid auction when the total number of bidders are: 2, 10, and 100.
How to solve this question?
Consider an antique auction where bidders have independent private values. There are two bidders, each of whom perceives that valuations are uniformly distributed between $100 and $1,000. One of the bidders is Sue, who knows her own valuation is $200. What is Sue's optimal bidding strategy in a Dutch auction?
Consider a sealed-bid auction in which the seller draws one of the N bids at random. The buyer whose bid was drawn wins the auction and pays the amount bid. Assume that buyer valuations follow a uniform(0,1) distribution.
1. What is the symmetric equilibrium bidding strategy b(v)?2. What is the seller’s expected revenue?3. Why doesn’t this auction pay the seller the same revenue as the four standard auctions? That is, why doesn’t the revenue equivalence theorem apply here?
Knowledge Booster
Similar questions
- Consider a Common Value auction with two bidders who both receive a signal X that is uniformly distributed between 0 and 1. The (common) value V of the good the players are bidding for is the average of the two signals, i.e. V = (X1+X2)/2. the symmetric Nash equilibrium bidding strategy for the second-price sealed-bid auction assuming that players are risk-neutral and have standard selfish preferences. Furthermore, you may assume that the other bidder is following a linear bidding strategy. Make sure to explain your notation and the steps you take to derive the result.arrow_forwardConsider 5 bidders whose values are independently and uniformly distributed over [0, 900] (a) For a buyer with value 100, what is his equilibrium bid in a first-price auction (FPA)?arrow_forwardConsider a Common Value auction with two bidders who both receive a signal X that is uniformly distributed between 0 and 1. The (common) value V of the good the players are bidding for is the average of the two signals, i.e. V = (X1+X2)/2. Compute the symmetric Nash equilibrium bidding strategy for the second-price sealed-bid auction assuming that players are risk-neutral and have standard selfish preferences. Furthermore, you may assume that the other bidder is following a linear bidding strategy. Make sure to explain your notation and the steps you take to derive the result.arrow_forward
- Suppose your utility over money (X) is given by u(x)3x-, where r=2/3. You are one of two bidders in a first price sealed bid auction. The other bidder places a bid randomly drawn from a uniform distribution between 0 and 10. 1. What is your optimal bid in this case? 2. Compare that number with what your optimal bid would be ifr were equal to 0. What is the explanation for this difference?arrow_forwardThe Government of Malaca has decided to sell pollution permits that will allow people to discharge pollutants into its largest freshwater lake. Each permit represents the right to discharge one tonne of pollutants. Malaca has determined that the lake will tolerate a maximum of 40 tonnes of pollutants per year and has decided to sell the permits using a Dutch auction. This means that the auction starts at a very high price, which is reduced in steps until the price reaches a level that will result in all 40 tonnes of pollution permits being sold at the same price. The results of the bidding are shown in table below. Price per PollutionPermit BidderA BidderB BidderC BidderD BidderE $5,500 2 5,000 4 6 4,500 6 6 1 1 1 4,000 8 7 2 2 2 3,500 10 7 4 3 3 3,000 12 9 6 3 4 2,500 14 10 8 3 5 2,000 16 11 9 4 6 1,500 18 12 10 4 7 a. What will be the price of pollution permits as a result of this auction? Price: $ b. Suppose that Bidder E happened to be an…arrow_forwardThe Government of Malaca has decided to sell pollution permits that will allow people to discharge pollutants into its largest freshwater lake. Each permit represents the right to discharge one tonne of pollutants. Malaca has determined that the lake will tolerate a maximum of 10 tonnes of pollutants per year and has decided to sell the permits using a Dutch auction. This means that the auction starts at a very high price, which is reduced in steps until the price reaches a level that will result in all 10 tonnes of pollution permits being sold at the same price. The results of the bidding are shown in table below. Price per Pollution Bidder Bidder Bidder Bidder Bidder Permit A. B D $5, 500 1 5,000 4,500 4,000 1. 1. 1 2 2. 3 2 1 2 3,500 3,000 2,500 2,000 4 3 2 4 4 4 3 4 4 1,500 7 a. What will be the price of pollution permits as a result of this auction? Price: $ b. Suppose that Bidder E happened to be an environmental protection group. If this group had not participated in the…arrow_forward
- Economics Consider a first-price sealed-bid auction of a single object with two bidders j = 1, 2. Bidder 1's valuation is v1 = 2, and bidder 2' s valuation is v2 = 5. Both v1 and v2 are known to both bidders. Bids must be in whole dollar amounts (e.g. $1). In the event of a tie, the object is awarded by a flip of a fair coin. (a) Write down this auction as a 2 × 2 matrix game. Hint: note that each bidder can choose a bid from {0, 1, 2, 3, 4, 5, ..}. Your matrix will be incomplete since you cannot write a matrix with infinite rows and columns (b) Eliminate the strictly dominated strategies. Write down the resulting matrix game. (c) An auction is efficient if the good is allocated to the bidder with the highest valuation of the good. What are the Nash equilibria of this game? Åre the Nash equilibria efficient? %3Darrow_forwardConsider a first-price sealed bid auction of a single object with two bidders j = 1,2 and no reservation price. Bidder 1′s valuation is v1 = 2, and bidder 2′s valuation is Consider the following auction. Two buyers (i = 1,2) have valuations uni- formly distributed over [0,1]. The good is assigned to the highest bid, but the winner pays the average of his bid and the losing bid. Use the revenue equivalence principle to derive the optimal strategies in a symmetric equilibrium. Assume that the optimal bid is a linear function of the buyer’s valuation: b(vi) = cvi where c is a real number.In the event of a tie, the object is awarded by a flip of a fair coinarrow_forwardThere are 4 bidders with valuations that are independently and uniformly distributed between 0 and 1. In equilibrium, what is the probability that the highest bid is less than 0.2 in a first-price auction? Round your answer to two decimal places.arrow_forward
- Suppose there are two bidders for a single object. Each bidder has a value for the object, v1 and v2, which is randomly drawn uniformly from 0 to 80. (Note that this means the probability that a value is 25 or lower is 25/80, and more generally, the probability that a value is k or lower is k/80). Bidders see their own values but not the values of their rival bidders. Consider a first price sealed bid auction where the winner of the object is the bidder who submits the highest bid and pays the price that he bid. Suppose that you are bidder 1 and you believe that your rival always bids a constant fraction α of his value. (For example, if bidder 2’ value is 15, he will bid 15α.). 1. What is your expected winning probability of the auction from any given bid b1? (You win the auction when your bid amount b1 is greater than your opponent’s bid). 2. What is your expected payoff from any given bid, b1? (Write answer as a function of v1, b1, and α). 3. Compute your best response bid given your…arrow_forwardDiscrete All-Pay Auction: In Section 6.1.4 we introduced a version of an all- pay auction that worked as follows: Each bidder submits a bid. The highest bidder gets the good, but all bidders pay their bids. Consider an auction in which player 1 values the item at 3 while player 2 values the item at 5. Each player can bid either 0, 1, or 2. If player i bids more than player j then i wins the good and both pay. If both players bid the same amount then a coin is tossed to determine who gets the good, but again both pay. a. Write down the game in matrix form. Which strategies survive IESDS? b. Find the Nash equilibria for this game.arrow_forwardSuppose there are N bidders competing for a single object in an all-pay auction. Each bidder has an i.i.d value vi for the object drawn from some continuous distribution F with support [0, M ]. (a) Show that there is a symmetric equilibrium in increasing strategies. (b) What is the expected revenue generated by this auction in the equilibrium from (a)? Elaborate the explanation on both the answers.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Managerial Economics: Applications, Strategies an...EconomicsISBN:9781305506381Author:James R. McGuigan, R. Charles Moyer, Frederick H.deB. HarrisPublisher:Cengage Learning
Managerial Economics: A Problem Solving ApproachEconomicsISBN:9781337106665Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike ShorPublisher:Cengage Learning
Managerial Economics: Applications, Strategies an...
Economics
ISBN:9781305506381
Author:James R. McGuigan, R. Charles Moyer, Frederick H.deB. Harris
Publisher:Cengage Learning
Managerial Economics: A Problem Solving Approach
Economics
ISBN:9781337106665
Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor
Publisher:Cengage Learning