You are a bidder in an independent private values auction, and you value the object at $4,500. Each bidder perceives that valuations are uniformly distributed between $1,000 and $10,000. Determine your optimal bidding strategy in a first-price, sealed-bid auction when the total number of bidders (including you) is: a. 2 bidders.Bid: $ b. 10 bidders.Bid: $ c. 100 bidders.Bid: $

You are a bidder in an independent private values auction, and you value the object at $4,500. Each bidder perceives that valuations are uniformly distributed between $1,000 and $10,000. Determine your optimal bidding strategy in a first-price, sealed-bid auction when the total number of bidders (including you) is: a. 2 bidders.Bid: $ b. 10 bidders.Bid: $ c. 100 bidders.Bid: $

Managerial Economics: A Problem Solving Approach

5th Edition

ISBN:9781337106665

Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Publisher:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Chapter18: Auctions

Section: Chapter Questions

Problem 1MC

See similar textbooks

Similar questions

You are one of five risk-neutral bidders participating in an independent private values auction. Each bidder perceives that all other bidders’ valuations for the item are evenly distributed between $10,000 and $30,000. For each of the following auction types, determine your optimal bidding strategy if you value the item at $22,000. a. First-price, sealed-bid auction. b. Dutch auction. c. Second-price, sealed-bid auction. d. English auction.
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.
You are a bidder in an independent private values auction, and you value the object at $4,000. Each bidder perceives that valuations are uniformly distributed between $1,500 and $9,000. Determine your optimal bidding strategy in a first-price, sealed-bid auction when the total number of bidders (including you) is: a. 2. b. 10. c. 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?
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?
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?
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? %3D
Suppose there are three bidders with values for the object that are independent, private and uniformly distributed over [0, 1]. a) Derive the seller's expected revenue in a second-price auction. Fully explain your answer. b) Derive the seller's expected revenue in a first-price auction. Fully explain your answer. c) Explain why the answers to parts (a) and (b) are the same. d) Show that the answers to parts (a) and (b) remain the same when there are N bidders. Fully explain your answer.
You are one of five risk-neutral bidders participating in an independent private values auction. Each bidder perceives that bidders' valuations for the item are evenly distributed between $20,000 and $50,000. For each of the following auction t determine your optimal bidding strategy if you value the item at $35,000. a. First-price, sealed-bid auction. O Bid $20,00. O Bid $50,00. O Bid $35,00. O Bid $32,000 b. Dutch auction O Let the auctioneer continue to lower the price until it reaches $20,000, and then yell "Minel". O Let the auctioneer continue to lower the price until it reaches $35.000, and then yell "Mine!" O Let the auctioneer continue to lower the price until it reaches $32,000, and then yell "Mine!" O Let the auctioneer continue to lower the price until it reaches $50,000, and then yell "Mine!". C. ond-price, sealed-bid auction O Bid $50,00. O Bid $35.000 O Bid $32,00. b. Dutch auction. O Let the auctioneer continue to lower the price until it reaches $20,000, and then yell…
Discrete 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.
Consider 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 coin
Why do sellers generally prefer a Vickrey auction to a regular sealed bid if sellers don’t receive the highest bid in the Vickrey auction? Sellers only have to sell their item if the bid is the highest-price bid. The second-highest bid in a Vickrey auction is generally higher than the highest bid in a regular sealed-bid auction. The second-highest bid is about the same in both auctions. Sellers prefer the final price is not revealed to all bidders. Sellers would never prefer Vickrey auctions.