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, V3 = 7, V4 5 and v5 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 ilibrium Explain bidding profil in a Noch =

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, V3 = 7, V4 5 and v5 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 ilibrium Explain bidding profil in a Noch =

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

When a famous painting becomes available for sale, it is often known which museum or collector will be the likely winner. Yet, the auctioneer actively woos representatives of other museums that have no chance of winning to attend anyway. Suppose a piece of art has recently become available for sale and will be auctioned off to the highest bidder, with the winner paying an amount equal to the second highest bid. Assume that most collectors know that Valerie places a value of $15,000 on the art piece and that she values this art piece more than any other collector. Suppose that if no one else shows up, Valerie simply bids $15,000/2=$7,500 and wins the piece of art. The expected price paid by Valerie, with no other bidders present, is $________.. Suppose the owner of the artwork manages to recruit another bidder, Antonio, to the auction. Antonio is known to value the art piece at $12,000. The expected price paid by Valerie, given the presence of the second bidder Antonio, is $_______. .
lease find herewith a payoff matrix. In each cell you find the payoffs of the players associated with a particular strategy combination: The first entry is the payoff of player 1, the second entry is the payoff of player2. Player 2 t1 t2 t3 Player 1 S1 3, 4 1, 0 5, 3 S2 0, 12 8, 12 4, 20 S3 2, 0 2, 11 1, 0 Suppose both players select their strategies (S1, S2 or S3 for player 1 and t1, t2 or t3 for player 2) simultaneously and that the game is played once. In your explanation to the questions below, please do refer to the figures in the matrix. Does player 2 have a dominant strategy? If so, which one? Does player 1 have a dominant strategy? If so, which one? No explanation required. Is there one or more Nash equilibria in the game? If so, which one(s)?
P1| P2 Left Middle Right Left 4,2 3,3 1,2 Middle 3,3 5,5 2,6 Right 2,1 6,2 3,3 Consider the simultaneous move game represented by this payoff matrix. Suppose that the game is repeated for two periods and the players know that the game will end at the end of two periods. They observe the first period outcome before they move to the second period. Assume that there is no discounting, i.e. 2nd period payoffs are not discounted, or the discount factor is equal to 1. Which of the following outcomes could occur in some subgame perfect equilibrium (SPE) of this repeated game? Choose True if you think the outcome can be a SPE, otherwise choose False. a) (Left, Left) is played in both periods. b) (Right, Right) is played in both periods. c) (Middle, Middle) is played in both periods. d) (Middle, Middle) is played in the first period, followed by (Left, Left). e) (Middle, Middle) is played in the first period, followed by (Right, Right).
Consider the following two-player game with three options for each player. (Payouts are listed for the row player first, then the column player.) player Y layery 3,3 A 1,5 4,4 6,2 K 8,1 3,7 5,2 0,6 1,1 Find a mixed Nash equilibrium for this game. Solution suggestion: Use two variables per player. If p and are the probabilities of selecting the first two strategies, then 1-p-q is the probability of selecting the third strategy. You will need to solve a system of equations.
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.
Problem 2. Consider the partnership-game we discussed in Lecture 3 (pages 81-87 of the textbook). Now change the setup of the game so that player 1 chooses x = [0, 4], and after observing the choice of x, player 2 chooses y ≤ [0, 4]. The payoffs are the same as before. (a) Find all SPNE (subgame perfect Nash equilibria) in pure strategies. (b) Can you find a Nash equilibrium, with player 1 choosing x = 1, that is not subgame perfect? Explain.
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 x 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? Are the Nash equilibria efficient?
You have three tickets to a Celtics game on a night that you are going to be out of town (so the value of unsold tickets is zero to you). There are only four possible buyers of a Celtics ticket. The table below lists the respective reservation prices of these four possible buyers: Customer Reservation Price 1 $25 2 $35 3 $50 4 $60 a) How much revenue can you generate using the English auction mechanism from the sale of the first ticket? [Bids can be made in increments of $1.00] b) How much revenue can you generate using the English auction mechanism from the sale of the second ticket? [Bids can be made in increments of $1.00] c) How much revenue can you generate using the English auction mechanism from the sale of the third ticket? [Bids can be made in increments of $1.00] d) How much total revenue can you generate using the English…
Suppose that you are a manager. You are considering whether or not to monitor employees with the payoffs in the normal-form accompanying game. Worker Work Shirk Manager Monitor -1,1 1,-1 Don't Monitor 1,-1 -1,1 Which of the following pairs of strategies constitutes a Nash equilibrium? Multiple Choice Manager monitors and worker shirks. Manager does not monitor and worker works. Manager monitors and worker works. O None of the answers is correct.
Consider the version of the Beauty Contest game from the class, in which the players are trying to guess the average guess minus one. More precisely, the utilities now are: ui (si; sj ) = -|si-(-1)| where sj/#l forj belong tI (a) Which strategies are strictly dominated in this game, and by which alternative strategies? And so, what is the set of strategies BR11 (b) What is the set BR21 ? What is the set BRni for any n > 0?
Define a new game as a modified version of the game in Problem 1, which we will call the Matching Two Pennies game: each player choose heads (H) or tails (T) for two pennies. In this game, Player 1 wins if both coins show the same combination of heads and tails, while Player 2 wins if they do not. (a) Write the strategy sets S1 and S2 for this game. (b) Give the payoffs for each player in this Matching Two Pennies game, by defining T;(81, 82) for each player and for each strategy pair, either as a list or in matrix form.
There are 4 bidders with valuations that are independently and uniformly distributed between 0 and 1. In equilibrium, what is the probability that the highest bid is less than 0.2 in a first-price auction? Round your answer to two decimal places.