Question

In: Economics

Consider the following game that has two players. Player A has three actions, and player B...

Consider the following game that has two players. Player A has three actions, and player B has three actions. Player A can either play Top, Middle or Bottom, whereas player B can play Left, Middle or Right. The payoffs are shown in the following matrix. Notice that a payoff to player A has been omitted (denoted by x).


Player B

  

Left Middle Right
Top (-1,1) (0,3) (1,10)
Middle (2,0) (-2,-2) (-1,-1)
Bottom (x,-1) (1,2) (3,2)

(player A)

Both players choose their actions separately and simultaneously. Each must decide what to do knowing the available actions and payoffs but not what the other will actually choose. Each player believes the other to be rational and self-interested.

a) Determine the range of values of x such that Player A HAS a strictly dominant strategy.

b) List Player B’s best responses to Player A’s actions.

c) Suppose that Player A has a strictly dominant strategy. Find all the Nash equilibrium/equilibria to the game.

d) Suppose that Player A does NOT have a dominant strategy. Find all the Nash Equilibria

Solutions

Expert Solution

(a) x ≥ 3 (x should be greater or equal to 3).

reason: In response to Player B's Middle and Right, Player A will choose strategy Bottom. So strategy Bottom is likely to be a dominant strategy for  Player A. If he should choose strategy Bottom against Player B's move Left too, it shoud be the highest value in the column Left for him. It should be greater than 2. So, x ≥ 3.

(b) When Player A moves Top, Player B will move Right as it has the highest payoff in that row for him (10>3>1). When Palyer A moves Middle, Player B will move Left as that is th highest payoff foor him in that row (0>-1>-2). If Player A moves Bottom (whatever the value of X, Player B will be indifferent between Middle and Right as both have the same payoff for him (2=2>-1).

(c) If Player A has a strictly dominant strategy, that strategy will be Bottom. Against Bottom, Player 2 will choose Middle or Right (as he is indifferent between the two). Thus Nash equilibria are (Bottom, Middle) and (Bottom, Right) with payoffs (1, 2) and (3, 2) respectively.

(d) If Player A has no dominant stratgy, then Nash equilibria are:
(Middle, Left), (Bottom, Middle) and (Bottom, Rght)
with payoffs (2, 0), (1, 2), and (3, 2) respectively.

reason:

When X is less than 2 (that is when Player 1 has no dominant strategy), Player 1 will choose Middle against Player 2's Left, Bottom against Player 2's Middle, and Bottom against Player 2's Right. Player 2 will choose Right against Player 1's Top, Left against Player 1's Middle and either Middle or Right against Player 1's Bottom. Thus, we see that player 1 and 2 coincide in 3 places: (Middle, Left), (Bottom, Middle) and (Bottom, Right).


Related Solutions

Consider a game with two players, each of whom has two types. The types of player...
Consider a game with two players, each of whom has two types. The types of player 1 are T1 = (a,b). The types of player 2 are T2 = (c,d). Suppose the beliefs of the types are p1(c/a) = p2(a/c) = 0.25 and p1(c/b) = p2(a/d) = 0.75. Is there a common prior? If yes, construct one; if no, prove why not.
Two players (player A and player B) are playing a game against each other repeatedly until...
Two players (player A and player B) are playing a game against each other repeatedly until one is bankrupt. When a player wins a game they take $1 from the other player. All plays of the game are independent and identical. Suppose player A starts with $6 and player B starts with $6. If player A wins a game with probability 0.5, what is the probability the game ends (someone loses all their money) on exactly the 10th play of...
(10 marks) Two players (player A and player B) are playing a game against each other...
Two players (player A and player B) are playing a game against each other repeatedly until one is bankrupt. When a player wins a game they take $1 from the other player. All plays of the game are independent and identical. a) Suppose player A starts with $2 and player B starts with $1. If player A wins a game with probability p, what is the probability that player A wins all the money? b) Suppose player A starts with...
Two players A and B play a dice game with a 6-face fair dice. Player A...
Two players A and B play a dice game with a 6-face fair dice. Player A is only allowed to roll the dice once. Player B is allowed to roll the dice maximally twice (that is, Player B can decide whether or not she or he would roll the dice again after seeing the value of the first roll). If the player with the larger final value of the dice wins, what is the maximal probability for Player B to...
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,...
1. Consider the following game. There are two piles of matches and two players. The game...
1. Consider the following game. There are two piles of matches and two players. The game starts with Player 1 and thereafter the players take turns. When it is a player's turn, she can remove any number of matches from either pile. Each player is required to remove some number of matches if either pile has matches remaining, and can only remove matches from one pile at a time. Whichever player removes the last match wins the game. Winning gives...
This game is meant for two or more players. In the game, each player starts out...
This game is meant for two or more players. In the game, each player starts out with 50 points, as each player takes a turn rolling the dice; the amount generated by the dice is subtracted from the player’s points. The first player with exactly one point remaining wins. If a player’s remaining points minus the amount generated by the dice results in a value less than one, then the amount should be added to the player’s points. (As an...
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.
5. Consider the following games played between two players, A and B.   Game 1: A and...
5. Consider the following games played between two players, A and B.   Game 1: A and B have reached a verbal agreement: A would deliver a case of beer to B, and B would deliver a bag of beer nuts to A. Now, each player needs to take an action: keep the promise (to deliver the goods), break the promise. If both keep their promises, then each player gets a payoff of 5; if both break their promises, then each...
Consider this childhood game with two players, A and B. There are 11 lit candles. The...
Consider this childhood game with two players, A and B. There are 11 lit candles. The players take turns blowing out 1, 2, or 3 candles, with A going first. The player that blows out the last candle wins. It is possible to solve this game using backwards induction. The numbers below may help you to organize your thoughts. 1 2 3 4 5 6 7 8 9 10 11 a. In equilibrium, which player wins the game? b. On...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT