Question

Player 2 A B C A 3,5 4,2 1,1 Player 1 B 5,3 3,6 4,5 C...

Player 2
A B C
A 3,5 4,2 1,1
Player 1 B 5,3 3,6 4,5
C 6,2 8,1 7,0

In the matrix game above, what is the payoff that Player 2 receives in the nash equilibrium outcome?

Homework Answers

Answer #1

Answer :

Here Player 1 is a row player and Player 2 is a column player.

From the game matrix we see that Player 1's strategy of playing C dominates over both A and B.

From Player 1's perspective : Payoff in A = 3 , 4 , 1 (Note : 6 > 3 , 8 > 4, 7 >1 when compared to strategy C)

Payoff in B = 5, 3 , 4 (Note : 6 > 5 , 8 >3 , 7 > 4 when compared to strategy C)

Payoff in C = 6, 8, 7

So from that we see that payoffs in C are higher than their corresponding payoffs in A and B both. Thus C is a dominant strategy and Player 1 will play C no matter what so we can delete A and B rows from the game.

The reduced game would look like:

A B C
C 6,2 8,1 7,0

where Player 1 is the row player and Player 2 is the column player.

In this scenario it is best for Player 2 to play strategy A (since Player 1 always plays C).

For Player 2 : A has a payoff of 2 , B has 1 and C has 0. Thus A gives the highest payoff and Player 2 will play A.

Thus the nash equilibrium of this game is (Player 1, Player 2) = (6 , 2) : So in nash equilibrium Player 1 gets a payoff of 6 and Player 2 gets a payoff of 2

Answer : Player 2 receives a payoff of 2 in the nash equilibrium outcome.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
1. Two dice are rolled. There are 36 possible outcomes, the sample space is: (1,1) (1,2)...
1. Two dice are rolled. There are 36 possible outcomes, the sample space is: (1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (5,1) (5,2) (5,3) (5,4) (5,5) (5,6) (6,1) (6,2) (6,3) (6,4) (6,5) (6,6) A = ‘second roll is a 6’ B = ‘sum of two dice equals 7’ C = ‘sum of two dice equals 3’ a. What is P(B|A)? b. What is...
Question 1: Roll two fair dice. Then the sample space S is the following. S =...
Question 1: Roll two fair dice. Then the sample space S is the following. S = (1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (5,1) (5,2) (5,3) (5,4) (5,5) (5,6) (6,1) (6,2) (6,3) (6,4) (6,5) (6,6) Let E be the event that the sum of the dice is odd, let F be the event that the first die lands on 1, and let G...
Pure strategy Nash equilibrium 3. In the following games, use the underline method to find all...
Pure strategy Nash equilibrium 3. In the following games, use the underline method to find all pure strategy Nash equilibrium. (B ) [0, 4, 4 0, 5, 3] [4, 0 0 4, 5, 3] [3, 5, 3, 5 6, 6] (C) [2, -1 0,0] [0,0 1,2] (D) [4,8 2,0] [6,2 0,8] (E) [3,3 2,4] [4,2 1,1] 4. In the following 3-player game, use the underline method to find all pure strategy Nash equilibria. Player 1 picks the row, Player 2...
Consider the following game. Player 1’s payoffs are listed first, in bold:                        Player 2 X...
Consider the following game. Player 1’s payoffs are listed first, in bold:                        Player 2 X Y Player 1 U 100 , 6   800 , 4 M 0 , 0 200 , 1 D 10 , 20 20 , 20 Imagine that Player 1 makes a decision first and Player 2 makes a decision after observing Player 1’s choice. Write down every subgame-perfect Nash equilibrium of this game. Does the outcome above differ from the Nash equilibrium (if the game...
Fill in a payoff matrix for a prisoner’s dilemma game where one player has a dominant...
Fill in a payoff matrix for a prisoner’s dilemma game where one player has a dominant strategy and the other doesn’t. Firm 2 in Duopoly Firm 1 in Duopoly a. Explain the dominant and non-dominant strategy of the firms. b. Is there a Nash equilibrium in your game? Explain.
4. Consider the following non-cooperative, 2-player game. Each player is a middle manager who wishes to...
4. Consider the following non-cooperative, 2-player game. Each player is a middle manager who wishes to get a promotion. To get the promotion, each player has two possible strategies: earn it through hard work (Work) or make the other person look bad through unscrupulous means (Nasty). The payoff matrix describing this game is shown below. The payoffs for each player are levels of utility—larger numbers are preferred to smaller numbers. Player 1’s payoffs are listed first in each box. Find...
Below is a game between player A and player B. Each player has two possible strategies:...
Below is a game between player A and player B. Each player has two possible strategies: 1 or 2. The payoffs for each combination of strategies between A and B are in the bracket. For example, if A plays 1 and B plays 1, the payoff for A is 1 and the payoff for B is 0. Player B Strategy 1 Strategy 2 Player A Strategy 1 (1,0) (0,1) Strategy 2 (0,1) (1,0) How many pure strategy Nash equilibria does...
QUESTION 3 Below is a game between player A and player B. Each player has two...
QUESTION 3 Below is a game between player A and player B. Each player has two possible strategies: 1 or 2. The payoffs for each combination of strategies between A and B are in the bracket. For example, if A plays 1 and B plays 1, the payoff for A is -3 and the payoff for B is -2. Player B Strategy 1 Strategy 2 Player A Strategy 1 (-3,-2) (10,0) Strategy 2 (0,8) (0,0) How many pure strategy Nash...
There are three cow shepherds, James (Player 1), Peter (Player 2) and John (Player 3), who...
There are three cow shepherds, James (Player 1), Peter (Player 2) and John (Player 3), who share a common parcel of land on which each of them are entitled to let their cows graze. All of them can simultaneously choose between cooperate or not-cooperate actions in deciding the number of cows that can graze in their common land. The following matrix shows that payoff received by all shepherds given their and other's actions. Player 3 Cooperate Cooperate Not Cooperate Cooperate...
Below is a game between player A and player B. Each player has two possible strategies:...
Below is a game between player A and player B. Each player has two possible strategies: 1 or 2. The payoffs for each combination of strategies between A and B are in the bracket. For example, if A plays 1 and B plays 1, the payoff for A is 1 and the payoff for B is 0. Player B Strategy 1 Strategy 2 Player A Strategy 1 (1,0) (0,1) Strategy 2 (0,1) (1,0) How many pure strategy Nash equilibria does...