Question

In: Economics

Consider the following game. Player 1’s payoffs are listed first:                        Player 2 X Y Player...

  1. Consider the following game. Player 1’s payoffs are listed first:

                       Player 2

X

Y

Player 1

A

90 , 1

10 , 0

B

10 , 0

50 , 1

C

100 , 0

80 , 1

  1. Imagine that player 1 makes a decision first and Player 2 makes a decision after observing player 1’s choice. What is the subgame-perfect equilibrium of this game?

  1. Imagine that player 2 makes a decision first and Player 1 makes a decision after observing player 2’s choice. What is the subgame-perfect equilibrium of this game?

  1. Are your answers to (a) and (b) above the same or different? Explain.

Solutions

Expert Solution

a. If player 1 were to move first, he would check Player 2's response to his moves before he makes the first move. If Player 1 were to move A, player 2 would respond with X with payoffs (90, 1). For B, player 2 would choose Y (payoffs 50, 1), and for C, player 2 would move Y (payoffs  80, 1). As we see from the payoffs, Player 1 gains most in the first move (90>80>50). Therefore he would move A and Player 2 would follow with X.

Thus, (A, X) is the Nash equilibrium with payoffs (90, 1).

b. If Player 2 were to move first, he too would check Player 1's response before going first. If he chose X, Player 1 would choose C with payoffs (100, 0). If he chose Y, Player 1 would choose C with payoffs (80, 1). Between the two options, Player 2 gains more in the second option. So he would choose Y and Player 1 would choose C. Therefore (C, Y) is the Nash equilibrium with payoffs (80, 1).

c. Yes. answers to (a) and (b) are different. This is caused by first mover's advantage. Each player checks the other player's reaction before choosing his strategy. For player 1, C is the optimum strategy against any stratgey of Player 2. Similrly, for Player 2, Y is better against Player 1's B and C, and X against player 1's A. Thus, whoever moves first gains by moving according to his advantage.


Related Solutions

Consider the following strategic-form simultaneous game. Player 1’s payoffs are listed first, in bold Player 2...
Consider the following strategic-form simultaneous game. Player 1’s payoffs are listed first, in bold Player 2 W X Y Z Player 1 A 2 , 500 30 , 400 200 , 200 4 , 4 B 5 , 50 20 , 40   10 , 20 4 , 4 C 1 ,   0 1 ,   4 3 ,   2 4 , 4 Does either player have any weakly dominant strategies? If yes, list them. Briefly explain. Does either player have any...
Consider the following two-player game. X Y A 1, 2 3, 2 B 2, 0 1,...
Consider the following two-player game. X Y A 1, 2 3, 2 B 2, 0 1, 1 a) Find the best response function for player 1. b) Find the best response function for player 2. c) Graph the best response function for both players, putting either p1(A) or p1(B) on the x-axis and putting either p2(X) or p2(Y) on the y-axis. d) Label all Nash equilibria on the graph from part c. e) Clearly state all Nash equilibria.
Consider the following two-player game, in which Player 1 is the IMF, and Player 2 is...
Consider the following two-player game, in which Player 1 is the IMF, and Player 2 is a debtor country. Reform Waste Aid 3, 2 -2, 3 No Aid -2, 1 0, 0 a) Compute all (pure and mixed) Nash equilibria. b) Do you think that the above game is the case of a resource curse? Interpret the game with a story of a resource curse.
Consider a game in which, simultaneously, player 1 selects any real number x and player 2...
Consider a game in which, simultaneously, player 1 selects any real number x and player 2 selects any real number y. The payoffs are given by: u1 (x, y) = 2x − x2 + 2xy u2 (x, y) = 10y − 2xy − y2. (a) Calculate and graph each player’s best-response function as a function of the opposing player’s pure strategy. (b) Find and report the Nash equilibria of the game. (c) Determine the rationalizable strategy profiles for this game.
The next three questions will refer to the following game table: Player 2 W X Y...
The next three questions will refer to the following game table: Player 2 W X Y Z A 1, 1 1, 2 2, 3 2, 4 Player 1 B 1, 2 2, 3 1, 4 4, 1 C 2, 3 2, 4 1, 1 1, 2 D 3, 4 3, 1 3, 2 2, 3 Q1. In the space below, answer the following questions: Does this game contain any strictly dominated strategies? (You do not need to list them right...
Question 4: Jar Game Consider the following game: Players: 2 - We designate player #1 to...
Question 4: Jar Game Consider the following game: Players: 2 - We designate player #1 to be the one that starts with the jar. Actions: - Each round at the same time both players deposit between 1 to 4 pennies into the jar. - Then both players are able to count the pennies in the jar. - If there are 21 or more pennies, the person with the jar is the winner. - If there are 20 or less pennies,...
Consider the following five utility functions. G(x,y) = (x)1/2 + y H(x,y) = (x+1)1/2 + y...
Consider the following five utility functions. G(x,y) = (x)1/2 + y H(x,y) = (x+1)1/2 + y + 1 L(x,y) = ln(x) + y U(x,y) = x ey W(x,y) = 100 x - 4x2 + 3 y Z(x,y) = -(100 - x)2 -3 (y-200)2 Which function or functions represent the same preferences as U?   a.G b.U c.None. d.W e.Z f.L g.H
1. Consider the following normal form game: 1\2 X Y Z A 3,3 0,5 0,4 B...
1. Consider the following normal form game: 1\2 X Y Z A 3,3 0,5 0,4 B 0,0 3,1 1,2 C -1,5 2,2 0,1 a. Does the game have a dominant strategy solution? If yes, which one? (no proof needed) (10 pts)                                                                                                          b. Does the game have a solution to IEDS? What is it? Show your procedure. (10 pts)
Assume that we have a two-player, static game with complete information with the following payoffs. Left...
Assume that we have a two-player, static game with complete information with the following payoffs. Left Right Up 8, 8 0, 10 Down 10, 0 4,4 a. Determine the pure strategy Nash equilibrium(s) for this game. b. Assume that this game is played two times only. Both players know that the game will be played only twice. What is the Nash equilibrium for this game? Explain your reasoning. c. Assume that this game is played an infinite number of times...
Coin taking game This game is played between 2 players, player 1 and player 2. There...
Coin taking game This game is played between 2 players, player 1 and player 2. There are two piles of coins. The values of a coin can be any integer. Both players know the values of all coins in both piles. Player 1 makes the first move, and play alternates between the players. A move consists of taking a coin from the top of either of the piles (either player can take from either pile). The game ends when both...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT