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.

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.

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

Consider the following game - one card is dealt to player 1 ( the sender) from a standard deck of playing cards. The card may either be red (heart or diamond) or black (spades or clubs). Player 1 observes her card, but player 2 (the receiver) does not - Player 1 decides to Play (P) or Not Play (N). If player 1 chooses not to play, then the game ends and the player receives -1 and player 2 receives 1. - If player 1 chooses to play, then player 2 observes this decision (but not the card) and chooses to Continue (C) or Quit (Q). If player 2 chooses Q, player 1 earns a payoff of 1 and player 2 a payoff of -1 regardless of player 1's card - If player 2 chooses continue, player 1 reveals her card. If the card is red, player 1 receives a payoff of 3 and player 2 a payoff of -3. If the card is black, player 1 receives a payoff of 2 and player 2 a payoff of -1 a. Draw the extensive form game b. Draw the Bayesian form game
Refer to Table Left-Right-ZigZag. How many pure strategy Nash equilibria does this game have? Table: Left-Right-ZigZag Player 1 Drive left Driver right Zigzag 1) 1 2) 2 3) 3 4) 4 5) None of the above. Drive left (1,1) (-1,-1) (0,0) Player 2 Driver right (-1,-1) (1,1) (0,0) Zigzag (0,0) (0,0) (0,0)
Consider the following 2-player normal form game. Player 2 Bananas Orange Player 1 Grapes 11, 3 8, 2 Apple 9, 7 6, 5 Player 1's dominant strategy is [Select ] and Player 2's dominant strategy is [ Select ) The Nash Equilibrium of this game is ( Select ) (select all that apply).
Two firms are competing to establish one of two new wireless communication standards, A or B. A strategy is a choice of standard, and an outcome of this game is a choice of standard by each firm – for example, (A, B) represents the case where Firm 1 decides to develop standard A and Firm 2 develops standard B. Here, the first letter will always correspond to Firm 1’s decision, and the second letter to Firm 2’s decision. Firm 1 has the following preferences over outcomes, in order of highest to lowest preferred: it prefers (A, A) to (B, A) to (A, B) to (B, B). Firm 2 prefers (A, B) to (A, A) to (B, A) to (B, B). Suppose that firms simultaneously decide which standard to develop. What is the pure strategy Nash equilibrium?
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.
Two players F and C obtain the payoffs described in the matrix below when playing strategies F1, F2 and F3 (for player F) and strategies C1, C2 and C3 for player C. Select the CORRECT statement C1 C2 C3 F1 8,2 1, 1 4,0 F2 0,2 5,1 1,0 F3 1,3 0, 100 9,0 Select one: The Nash equilibrium in pure strategies is [F1, C1] ○ b. There is no Nash equilibrium in pure strategies c. Player C dominant strategy is C1 ○ d. Player F dominant strategy is F1 e. The Nash equilibrium in pure strategies is [F3, C2]
the Consider a simultaneous-move integer game between two players: Marilyn and Noah. Each of player is required to announce a positive integer between 1 to 4. In other words, a player can announce 1, 2, 3, or 4. Two players announce their integers simultaneously. Notice that this game is different from the games we learned in class in that each player has four actions to take. The payoffs of the players in the game are specified as follows: (1) when the two announced integers are different, whoever reports the lower number pays $1 to the other player, so that the loser of the game has payoff -1 and the winner of the game has payoff 1; (2) when the two players announce the same integer, their payoffs are both O. What is Marilyn's maximin strategy? 01 02 03 O
You suspect that you are a price leader in the market. Moreover, you are considering expanding your operations. H.R. Shovenstuff will observe your moves and then follow, but he is more secretive so you will not know whether to price high or low after his pricing decision has been made. Using the following game tree, solve for the Nash equilibrium. High Price Shovenstuff High Price Low Price You High Price (2,1) (6,2) Invest Low Price Invest, High Price, High Price O Invest, Low Price, High Price Invest, Low Price, Low Price O Don't Invest, High Price, High Price Don't Invest, Low Price, High Price LOW Price (2,4) You High Price (4,4) Don't Invest High Price Low Price Shovenstuff Low Price You High Price (8,1) (2.6) Low Price (2,1)
= a) Suppose x 4 and y = 3. After all strategies that are dominated by a pure strategy are iteratively deleted for both players, how many strategies remain for Player 1? b) Suppose x = 4 and y = 3. After all strategies that are dominated by a pure strategy are iteratively deleted for both players, how many strategies remain for Player 2? c) Suppose x = 4 and y = 3. What is the sum of both players' payoffs in all pure strategy Nash equilibria of the game? d) Suppose x = 4 and y = 11. After all strategies that are dominated by a pure strategy are iteratively deleted for both players, how many strategies remain for Player 1? e) Suppose x = 4 and y = 11. After all strategies that are dominated by a pure strategy are iteratively deleted for both players, how many strategies remain for Player 2? f) Suppose x = 4 and y = 11. What is the sum of both players' payoffs in all pure strategy Nash equilibria of the game?
Q3