Consider the following simple model of a common values auction. Two buyers each obtain a private signal about the value of an object. The signal can be either high (H) or low (L) with equal probability. If both obtain signal H, the object is worth 1; otherwise, it is worth 0. Suppose the buyer sees a signal of L, the expected value of the object to the buyer is the buyer sees a signal of H. the expected value of the object to the buyer is . Suppose (NOTE: Write your

Consider the following simple model of a common values auction. Two buyers each obtain a private signal about the value of an object. The signal can be either high (H) or low (L) with equal probability. If both obtain signal H, the object is worth 1; otherwise, it is worth 0. Suppose the buyer sees a signal of L, the expected value of the object to the buyer is the buyer sees a signal of H. the expected value of the object to the buyer is . Suppose (NOTE: Write your

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter18: Asymmetric Information

Section: Chapter Questions

Problem 18.8P

See similar textbooks

Similar questions

A Bank has foreclosed on a home mortgage and is selling the house at auction. There are two bidders for the house, Zeke and Heidi. The bank does not know the willingness to pay of these three bidders for the house, but on the basis of its previous experience, the bank believes that each of these bidders has a probability of 1/3 of valuing it at $800,000, a probability of 1/3 of valuing at $600,000, and a probability of 1/3 of valuing it at $300,000. The bank believes that these probabilities are independent among buyers. If the bank sells the house by means of a second- bidder, sealed-bid auction, what will be the bank’s expected revenue from the sale? The answer is 455, 556. Please show the steps in details thank you!
Suppose two bidders compete for a single indivisible item (e.g., a used car, a piece of art, etc.). We assume that bidder 1 values the item at $v1, and bidder 2 values the item at $v2. We assume that v1 > v2. In this problem we study a second price auction, which proceeds as follows. Each player i = 1, 2 simultaneously chooses a bid bi ≥ 0. The higher of the two bidders wins, and pays the second highest bid (in this case, the other player’s bid). In case of a tie, suppose the item goes to bidder 1. If a bidder does not win, their payoff is zero; if the bidder wins, their payoff is their value minus the second highest bid. a) Now suppose that player 1 bids b1 = v2 and player 2 bids b2 = v1, i.e., they both bid the value of the other player. (Note that in this case, player 2 is bidding above their value!) Show that this is a pure NE of the second price auction. (Note that in this pure NE the player with the lower value wins, while in the weak dominant strategy equilibrium where both…
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 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).…
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…
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.
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.
Use the expected value information to illustrate how having more bidders in an oral auction will likely result in a higher winning bid.
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
Game Theory Consider the entry game with incomplete information studied in class. An incumbent politician's cost of campaigning can be high or low and the entrant does not know this cost (but the incumbent does). In class, we found two pure-strategy Bayesian Nash Equilibria in this game. Assume that the probability that the cost of campaigning is high is a parameter p, 0 < p < 1. Show that when p is large enough, there is only one pure-strategy Bayesian Nash Equilibrium. What is it? What is the intuition? How large does p have to be? Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.
Suppose there are two players playing a game with east or west and south and nerth ways. Find the expected Nash equilibrium by using the concept of probabilities. Player X Left[L) Right|R) Player Y Up(U) (5,6) (0,8) (4,6) Down[D) (0,9)
Here is a Bayesian BOS game. Man has a special preference t1 on boxing while woman has a special preference t2 on opera. Both are in [0,2]. The preference information is private. i.e. Each knows his (her) own preference but does not know the other's preference. The below is the payoff. M/W Boxing Opera Воxing 3+t1,1 0,0 Opera 0,0 1,3+t2 We are checking whether the below strategy profile is a Bayesian Nash Equilibrium. "Man chooses boxing if t1>p while woman chooses opera if t2>g." 1) Given t1, man will choose boxing if t1> /g- 2) Given t2, woman will choose opera if t2> /p- 4) By shoving the simultaneous equations, we get p=q=sqrt(6)-