Two bidders compete in a sealed-bid auction for a single indivisible object. For each bidder , the valuation of the object is uniformly distributed on [0, 1]. The valuations of the two bidders are independent. Each bidder knows her own valuation, but not the valuation of the other bidder. The bidders simultaneously submit bids b = [0, ∞), and whoever submits the higher bid wins the object and pays the average of the two bids. In case of a tie, each bidder wins the object with probability 1/2 and again the winner pays the average of the two bids. Find a Nash equilibrium of this game in which each bidder's strategy is linear in her valuation.

Two bidders compete in a sealed-bid auction for a single indivisible object. For each bidder , the valuation of the object is uniformly distributed on [0, 1]. The valuations of the two bidders are independent. Each bidder knows her own valuation, but not the valuation of the other bidder. The bidders simultaneously submit bids b = [0, ∞), and whoever submits the higher bid wins the object and pays the average of the two bids. In case of a tie, each bidder wins the object with probability 1/2 and again the winner pays the average of the two bids. Find a Nash equilibrium of this game in which each bidder's strategy is linear in her valuation.

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

David wants to auction a painting, and there are two potential buyers. The value for eachbuyer is either 0 or 10, each value equally likely. Suppose he offers to sell the object for $6, and the two buyers simultaneously accept or reject. If exactly one buyer accepts, the object sold to that person for $6. If both accept, the object is allocated randomly to the buyers, also for $6. If neither accepts, the object is allocated randomly to the bidders for $0. (a) Identify the type space and strategy space for each buyer. (b) Show that there is an equilibrium in which buyers with value 10 always accept. (c) Show that there is an equilibrium in which buyers with value 10 always reject.
A game is played as follows: First Player 1 decides (Y or N) whether or not to play.If she chooses N, the game ends. If she chooses Y, then Player 2 decides (Y or N) whetheror not to play. If he chooses N the game ends. If he chooses Y, then they go ahead and playanother game with the payoffs shown below. A player who opts out by choosing N gets 2 andthe other player gets 0. Draw the tree of this game and then find the two subgame-perfect Nashequilibria.
The mixed stratergy nash equalibrium consists of : the probability of firm A selecting October is 0.692 and probability of firm A selecting December is 0.309. The probability of firm B selecting October is 0.5 and probability of firm selecting December is 0.5. In the equilibrium you calculated above, what is the probability that both consoles are released in October? In December? What are the expected payoffs of firm A and of firm B in equilibrium?
2. Suppose we have 2 players in a first price auction. More specifically, suppose player i values the object being auctioned at v, where v > vz > 0. These valuations are known to both players. They simultaneously choose bids b;. Whoever bids the most gets the object and pays what she bid. In case of a tie, each player has probability of receiving the good and paying her bid and probability of a payoff of 0. Suppose the strategy set (set of all possible bids) for each player is [0, 0). Show that there is no pure strategy Nash equilibrium.
A cool kid is willing to rename himself for a profit. He decides to auctionoff the naming right. Two bidders show interest. Their valuations for thenaming right are independently and uniformly distributed over [0,100].There are several possible ideas to design the auction. a) The auction runs as follows. Both bidders are invited to the sameroom; an auctioneer will start the auction with an initial price 0, and increase it by $1 every minute. The bidders are not allowed to say anything during the process, but they can walk out of the room at any moment. If one bidder walks out of the room when the price increases to p (the bidder does not need to pay), the remaining bidder will be awarded the naming right for a price of p. If both walk out when the price reaches p, the naming right is not assigned and the two bidders do not need to pay. What should the bidders do? Explain your answer. (b) Both bidders are invited to submit their bids covertly (bids are non-negative real numbers).…
Player 2 C D A Player 1 2,3 В 6, —2 | 4, 3 7,8 Select the value corresponding to the probability with which player 2 plays C in the mixed strategy Nash equilibrium: O 1/8 O 1/6 1/5 O 1/4 1/3 1/2 2/3 O 3/4 4/5 O 5/6
What amount does each bidder bid in the Bayesian Nash equilibrium of a 2nd price auction? O The expected value of the second highest bidder. One half of the expected value of the second highest bidder. Their own value. One half of their own value.
A cool kid is willing to rename himself for a profit. He decides to auctionoff the naming right. Two bidders show interest. Their valuations for thenaming right are independently and uniformly distributed over [0,100].There are several possible ideas to design the auction. The auction runs as follows. Both bidders are invited to the same room; an auctioneer will start the auction with an initial price 0, and increase it by $1 every minute. The bidders are not allowed to say anything during the process, but they can walk out of the room at any moment. If one bidder walks out of the room when the price increases to p (the bidder does not need to pay), the remaining bidder will be awarded the naming right for a price of p. If both walk out when the price reaches p, the naming right is not assigned andthe two bidders do not need to pay. What should the bidders do? Explain your answer.
If some auction participants for crude-oil field leases have estimates that the oil in the ground is worth $1.2 million, $1.3 million, or $1.5 million with certainty; other auction participants have estimates that the same oil field lease is worth $1.1 million, $1.3 million, or $1.5 million with certainty; and a third group of auction participants have estimates that the same oil field lease is worth $1.1 million, $1.2 million, or $1.3 million, and all three forecasts contain the true common value, what is that value? How would you as auctioneer-seller design an auction to reduce strategic underbidding and realize this true value?
4 A recently discovered painting by Picasso is on auction at Sotheby's. There are two main bidders Amy and Ben {1,2}. Bidding starts at £10M but the value of the painting is certainly not more than £20M. Each bidder's valuation v; is independently and uni- formly distributed on the interval [10M, 20M], and this is common knowledge among the players: A bidder knows their own valuation but not of their opponent. Consider an auction where an object is allocated to the highest bidder but the price paid by the bidder is determined randomly. With probability 3/4, the bidder pays their own bid, and with probability 1/4 the bidder pays the losing bid. The person bidding lowest pays nothing. If the bids are equal, each bidder gets the object with probability one-half, and in this case, pays their bid. Suppose that bidder 1 assumes that bidder 2 will bid a constant fraction, Y, of bidder 2's valuation (and similarly, bidder 2 assumes bidder 1 will bid the same constant propor- tional value y of…
4 A recently discovered painting by Picasso is on auction at Sotheby's. There are two main bidders Amy and Ben {1,2}. Bidding starts at £10M but the value of the painting is certainly not more than £20M. Each bidder's valuation v; is independently and uni- formly distributed on the interval [10M, 20M], and this is common knowledge among the players: A bidder knows their own valuation but not of their opponent. Consider an auction where an object is allocated to the highest bidder but the price paid by the bidder is determined randomly. With probability 3/4, the bidder pays their own bid, and with probability 1/4 the bidder pays the losing bid. The person bidding lowest pays nothing. If the bids are equal, each bidder gets the object with probability one-half, and in this case, pays their bid. Suppose that bidder 1 assumes that bidder 2 will bid a constant fraction, 7, of bidder 2's valuation (and similarly, bidder 2 assumes bidder 1 will bid the same constant propor- tional value y of…
In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. Is there a pure strategy? Why or why not? Determine the optimal strategies and the value of this game. Does the game favor one player over the other? Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy.