4. An auctioneer holds a second-price auction for two bidders, Ann (A) and Bonnie (B), who have independent private values of the good 0 and 0. If a bidder wins, her payoff is her value 0 minus the price she pays, and if she loses, her payoff is 0. The values are independently and identically distributed, but otherwise you don't need to know the specific distributions to solve the problem. Ann and Bonnie's respective strategies are to bid some value be). that is, bid given their privately-known value (type). a. Explain what a second price auction is, who wins given some pair of bids b, and bg and what the winner pays. b. Why is a strategy where Ann bids above her own value e, weakly dominated by a strategy where she bids her value? c. Why is a strategy where Ann bids below her own value e, weakly dominated by a strategy where she bids her value?

4. An auctioneer holds a second-price auction for two bidders, Ann (A) and Bonnie (B), who have independent private values of the good 0 and 0. If a bidder wins, her payoff is her value 0 minus the price she pays, and if she loses, her payoff is 0. The values are independently and identically distributed, but otherwise you don't need to know the specific distributions to solve the problem. Ann and Bonnie's respective strategies are to bid some value be). that is, bid given their privately-known value (type). a. Explain what a second price auction is, who wins given some pair of bids b, and bg and what the winner pays. b. Why is a strategy where Ann bids above her own value e, weakly dominated by a strategy where she bids her value? c. Why is a strategy where Ann bids below her own value e, weakly dominated by a strategy where she bids her value?

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

L 0 4 15.1 X₂ A M R 0 1 4 0 2 B L 4 0 с X3 M R 0 1 3 FIGURE 15.5 Exercise 15.1. Equilibrium Selection: Consider the extensive-form game in Figure 15.5. a. Find all the Bayesian Nash equilibria of this game. b. Which of the Bayesian Nash equilibria are also perfect Bayesian equi- libria? Why?
There are a kicker and a goalie who confront each other in a penalty kick that willdetermine the outcome of the game. The kicker can kick the ball left or right, while the goaliecan choose to jump left or right. Because of the speed of the kick, the decisions need to bemade simultaneously. If the goalie jumps in the same direction as the kick, then the goalie winsand the kicker loses. If the goalie jumps in the opposite direction of the kick then the kickerwins and the goalie loses. Model this as a strategic form game and write down the matrix thatrepresents the game you modeled. Find the Nash equilibrium.
Exercise 6.8. Consider the following extensive-form game with cardinal payoffs: 1 R O player pay 000 2 1 M 3 b 010 O player 3's payoff 1 2 221 2 000 0 0 (a) Find all the pure-strategy Nash equilibria. Which ones are also subgame perfect? (b) [This is a more challenging question] Prove that there is no mixed-strategy Nash equilibrium where Player 1 plays Mwith probability strictly between 0 and 1.
In game theory, a dominant strategy is the best strategy to pick, no matter which moves are chosen by the other player. O to make the exact same move that was made by the other player. the choice that causes the payoff for the other player to be minimized, regardless of the payoff it earns the best strategy to pick, assuming the other player makes his or her best possible choice. to allocate all personnel resources towards defensive talent in order to dominate opposing offenses. 46°F
Bob - Don't Confess Confess В: 10 years J: 10 years В: 20 years J: 1 year Confess Joe В: 1 year J: 20 years В: 2 years J: 2 years Don't Confess The tal above shows the payoff matrix for a prisoners' dilemma. In the Nash equilibrium O Joe will serve 20 years, and Bill will serve 1 year. Bill will serve 20 years, and Joe will serve 1 year. O Both prisoners get 2 years in jail. Both prisoners get 10 years in jail.
6. The owner of an antique piece of furniture is looking to sell their good to a known buyer. The seller has a reservation value r whereas the buyer has valuation v > r. Suppose the buyer incurs a one-off transportation cost of t from travelling to the seller to purchase the good. Assume that r, vand t are known to both parties. The game proceeds in two stages: First, the buyer decides whether or not to travel to the seller's location in order to purchase. Second, if they travel then the seller makes a take-it-or-leave-it offer (ultimatum) of price p to the buyer, which the buyer then can either accept or reject. (a) Represent this game in extensive form (b) Find the seller's optimal offer in Stage 2 of this game given that the buyer has already travelled. Is it accepted or rejected? (c) Find a Subgame Perfect Equilibrium of this game. (d) Are there any Nash equilibria which are not subgame perfect? Give an example if one exists. (e) Suppose the seller could offer free delivery at a…
- 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. = =
2. Consider the following Bayesian game with two players. Both players move simultaneously and player 1 can choose either H or L, while player 2's options are G, M, and D. With probability 1/2 the payoffs are given by "Game 1" : GMD H 1,2 1,0 1,3 L 2,4 0,0 0,5 and with probability 1/2 the payoffs are according to "Game 2" : G |M|D H 1,2 1,3 1,0 L 2,4 0,5 0,0 (a) Find the Nash Equilibria when neither player knows which game is actually played. (b) Assume now that player 2 knows which one among the two games is actually being played. Check that the game has a unique Bayesian Nash Equilibrium.
2.19. Standard setting. Suppose Apple and Samsung are in the process of negotiating a common standard for a new 3D camera tech- nology they plan to introduce in the next generation of smartphones. Apple has a preference for standard A, whereas Samsung has a pref- erence for standard S. However, both recognize that multiple stan- dards are a worse outcome for all. Specifically, Apple gets 240 if it selects A and Samsung does so too, but only 20 if Samsung does not adopt A. If Apple adopts standard S and Samsung does so too, then Apple gets a payoff of 190. If, however, Samsung chooses A then Ap- ple gets zero. For Samsung, the situation looks similar: If Samsung chooses standard S and Apple does the same then Samsung gets 210, but if Apple chooses A the Samsung's payoff is only 30. If Samsung opts for standard A and Apple does so too then Samsung gets a pay- off of 110, whereas if Apple chooses standard S then Samsung gets a payoff of zero. (a) Suppose that both Apple and Samsung…
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…
You are playing a game with a friend. It’s yourmove but you don’t have a dominant strategy.Your payoff depends on what your friend doesafter your move. You consider flipping a coin todecide what to do. You are about to reach for acoin, but then you realize that your friend has adominant strategy. Explain how using backwardinduction (rather than a coin toss) will now determine your next move
5. The following problem was first considered by John von Neumann and is a fundamentalresult game theory.A and B play the following game:A writes down either number 1 or number 2, and B must guess which one.If the number that A has written down is i and B has guessed correctly, B receives i units from A.If B makes a wrong guess, B pays 4/5 of a unit to A.First we consider the expected gain of player B.Suppose B guesses 1 with probability p and 2 with probability 1 −p.Let X1 denote B’s gain (or loss) in a game where A has written down 1.Let X2 denote B’s gain (or loss) in a game where A has written down 2.(a) Find the pmf of X1 and X2(b) Find B’s expected gain for these two cases, E[X1] and E[X2].(c) What value of p maximizes the minimum possible value of B’s expected gain?Now consider the expected loss of player ASuppose that A writes down 1 with probability q and 2 with probability 1 −q.Let Y1 be A’s loss (or gain) if B chooses number 1.Let Y2 be A’s loss (or gain) if B…