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? %D

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? %D

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

PLEASE CHECK THIS HOW TO SOLVE
PLEASE CHECK THIS HOW TO SOLVE
Two firms bid for a contract to build a university building. Their construction costs are independent and uniformly drawn from [0,1]: Both bidders submit their bids si- multaneously. The winner is the bidder who submits a lowest bid. Tie-breaking rule is random. This kind of bidding game is called i'reverse auction' because the bidders bid for the right to provide a service and the winner is paid for the service. The FCC in 2017 has adopted similar auctions designed to repurpose spectrum for new uses. (a) In the first auction, the winner gets paid the loser's bid. For example, if the winner's cost is 0.5, his bid is 0.56, and the loserís bid is 0.6, then the winner gets the contract and the university pays the winner 0.6. The winner's net profit from the contract is 0.6-0.5 = 0.1. Solve for a Bayesian Nash equilibrium of this auction. What is the equilibrium bid of a firm bid if his cost is actually 0.5? (b) In the second auction, the winner gets paid the his/her own winning…
in every Nash equilibrium, the strategy of every player is a best response to the strategies chosen by the other players. (a) True. (b) False.
Question 3: Auction Theory a) What is the difference between a common value auction and a private value auction? b) What is meant by the winner’s curse? c) Is there a winner's curse on a private value auction?
See attachments for question context. Question: Some people advocated the following modifiction of the auction rule. A bidder cannot bid for only one object, i.e., if at some point in time he withdraws from the bidding race for one object, he automatically withdraws the race for the other object. Every other aspect of the auction, including how prices increase over time, does not change. What should a bidder do if his valuation for the two objects are 50 and 60, respectively? Explain. Does the auction lead to an efficient allocation? Explain.
3. This game is based on the book "Real Men Don't Eat Quiche" by Bruce Feirstein. There are two players sitting at a bar. The timing is as follows: i. Nature determines P1's type as "wimp" or "surly". P1 observes it, P2 doesn't. (and this is common knowledge) ii. P1 chooses whether to order a beer or a quiche. iii. P2 sitting next to P1, observes P1's choice. Then P2 decides whether to start a fight with P1 or not. The extensive form is given below. Let numbers p and q denote P2's conditional beliefs in the two information sets. 1,3 FB 2 FQ 2,1 BW 1W QW 2 P 4,0 NB 9. [0.3] wimp NO 0,0 1,0 FB 2,4 NB [0.7] surly FQ 1,2 1-q 2 B$ 15 Q 2 NO 0,1
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
(a) Calculate the safety levels of both players.(b) Find the set of all Nash equilibria (pure and mixed).
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.
No written by hand solution Cooperation between players in a finitely repeated game is difficult to maintain. Why is this the case? Group of answer choices Each player has an incentive to deviate from the cooperative strategy during the last period of the game. A Nash equilibrium is not possible in finite repeated games. Finite games only work if there are more than 20 periods. Both players are likely to be discovered by the authorities before the end of the game.
- First-Price and Second-Price Auctions - Consider an auction of a single indi- visible object with 5 bidders, 1, 2, 3, 4 and 5, whose personal valuations (willingness to pay) for the object are v₁ = 10, V₂ = 8, 03 7, 04 5 and 5 3. The bidders simultaneously submit their bids and the winner is the one with the highest bid. Suppose that, when the highest bidder is not unique, the bidder with the smallest number (highest valuation) wins. (a) Suppose that this is a second-price auction, where the winner pays the highest bid among those from her opponents, determine whether each of the following bidding profiles is a Nash equilibrium. Explain. (i) (b₁,b2, b3, b4, b5) = (10, 8, 7, 5, 3) (ii) (b1,b2, b3, b4, b5) = (8,8, 0, 0, 0) (iii) (b₁,b2, b3, b4, b5) = (10, 0, 0, 0, 10) (b) Now suppose that this is a first-price auction, where the winner pays their own bid, determine whether each of the bidding profiles above is a Nash equilibrium. Explain. = =