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.

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.

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

7.
3
An object is sold in a first-price auction – thus, the highest bidder wins the object and price is equal to the highest bid. There are two bidders, an "Odd" bidder (player 1) and an "Even" bidder (player 2). The odd bidder must bid an odd integer between 1 and 9, while the Even bidder must bid an even integer between 2 and 10. (So the strategy sets are {1,3, ...,9} and {2,4, ..., 10}.) The value of the object to the Odd bidder is 8, and value of the object to the Even bidder is 7. The payoff to the winner is the value of the object minus the price, and the payoff to the loser is 0. (a) Write the game in its strategic form. (b) Find all Nash equilibria.
Find the Nash equilibrium outcome for both treatments of the multi-stage bargaining game. In the first treatment, the pie shrinks from $5 to $4 and in the second treatment, the pie shrinks from $5 to $2. In both treatments, only integer dollar amounts are allowable.
(The All-Pay Auction). The seller has an item for sale. The valuations of the bidders are independently and identically distributed on R+ with a c.d.f. F. Find the symmetric equilibrium of an auction with two bidders in which both bidders pay their own bids but only the highest bidder wins the object. Show that each bidder’s expected payment is the same in this auction and in the first-price auction.
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 $_______. .
Exercise 1.8. Consider the following "third-price" auction. There are n≥ 3 bidders. A single object is auctioned and Player / values the object $v,, with V, > 0. The bids are simultaneous and secret. The utility of Player / is: 0 if she does not win and (v-p) if she wins and pays $p. Every non-negative number is an admissible bid. Let b, denote the bid of Player i. The winner is the highest bidder. In case of ties the bidder with the lowest index among those who submitted the highest bid wins (e.g. if the highest bid is $120 and it is submitted by players 6, 12 and 15, then the winner is Player 6). The losers don't get anything and don't pay anything. The winner gets the object and pays the third highest bid, which is defined as follows. Let be the winner and fix a Player j such that b₁ = max({b,,...,b,}\ {b}) [if GAME THEORY - Giacomo Bonanno 39 max({b,...,b}\{b;}) contains more than one element, then we pick one of them]. Then the third price is defined as max({b₁,...,b}\{b,,b;}).…
Analyze the following game. Create payoff bimatrices consistent with the information given. Explain your choices. Then find the maximin moves, all dominated strategies for all players. Game: Adam, Bill, and Cindy are registering for a foreign language class independently and simultaneously. The available classes are ITA100 and FRE100. They d not care much which, but they care with whom they share the class. Bill and Cindy want to be in the same class, but want to avoid Adam. Adam wants to be in the same class as Bill or Cindy, or even better, both.
Question 4 Consider allocating an object to one of two players when each player's pref- erences are her private information. Player 1's value for the object, denoted by vị is drawn from a continuous distribution with (1. 2] as its support. Player 2's value for the object, denoted by v2, is likewise drawn from the interval 0, 1]. 1. What is the equilibrium in dominant strategies if a second price auction is used to allocate the object. Is the outcome ex-post efficient? 2. For what pairs (v1, v2) should Player 1 and Player 2 respectively be allocated the object in a mechanism that maximizes expected revenue for the seller? 3. Comment on the differing allocations you obtained in the previous two parts.
Jane is interested in buying a car from a used car dealer. Her maximum willingness to pay for thecar is 12 ($12,000). Bo, the dealer, is willing to sell the car as long as he receives at least 9($9,000). What is the Nash bargaining solution to this game?
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.
PLEASE HOW TO THINK ABOUT IT AND SOLVE