Question

1. A game with two players, Player 1 and Player 2, is represented in the matrix...

1. A game with two players, Player 1 and Player 2, is represented in the matrix below. Player 1 has two possible actions, U, M and D, and Player 2 has three possible actions, L, C and R.

Player 2

   L C R

U 1,0 4,2 7,1

Player 1 M 3,1 4,2 3,0

D 4,3 5,4 0,2

(a) Which of player 1’s actions are best responses when player 2 chooses action R?

(b) Which of player 1’s actions are best responses when player 2 uses the mixed strategy (σ2(L), σ2(C), σ2(R)) = (2/3, 0, 1/3)?

(c) Which of player 1’s actions are best responses when player 2 uses the mixed strategy (σ2(L), σ2(C), σ2(R)) = (1/2, 1/4, 1/4)?

(d) Can you construct a strategy (possibly mixed) for player 1 that makes L a best response for player 2? If yes, do so. If no, explain why not.

Homework Answers

Answer #1

a) When player 2 chooses action R, action U gives player 1 the highest payoff = 7.

b) When player 2 uses the mixed strategy (σ2(L), σ2(C), σ2(R)) = (2/3, 0, 1/3), we see that actions U and M can both be best responses for Player 1 as both of them give expected payoff 3.

c) When player 2 uses the mixed strategy (σ2(L), σ2(C), σ2(R)) = (1/2, 1/4, 1/4), all the actions U,M and D provide player 1 with equal payoffs = 13/4

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
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...
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...
The next two questions will refer to the following game table: Player 2 S T F...
The next two questions will refer to the following game table: Player 2 S T F 7, 3 2, 4 Player 1 G 5, 2 6, 1 H 6, 1 5, 4 Question1. This game has one mixed-strategy Nash equilibrium in which Player 1 uses a mixed strategy consisting only of F and H. Find this MSNE, and fill in the blanks below to state it formally: P(F) = P(G) = P(H) = P(S) = P(T) = Question2 This game...
Consider the Matching Pennies game: Player B- heads Player B- tails Player A- heads 1, -1...
Consider the Matching Pennies game: Player B- heads Player B- tails Player A- heads 1, -1 -1, 1 Player A- tails -1, 1 1, -1 Suppose Player B always uses a mixed strategy with probability of 1/2 for head and 1/2 for tails. Which of the following strategies for Player A provides the highest expected payoff? A) Mixed strategy with probability 1/4 on heads and 3/4 on tails B) Mixed Strategy with probability 1/2 on heads and 1/2 on tails...
Consider the following game.  Player 1 has 3 actions (Top, middle,Bottom) and player 2 has three actions...
Consider the following game.  Player 1 has 3 actions (Top, middle,Bottom) and player 2 has three actions (Left, Middle, Right).  Each player chooses their action simultaneously.  The game is played only once.  The first element of the payoff vector is player 1’s payoff. Note that one of the payoffs to player 2 has been omitted (denoted by x).                                                 Player 2 Left Middle Right Top (2,-1) (-2,3) (3,2) Middle (3,0) (3,3) (-1,2) Bottom (1,2) (-2,x) (2,3)                 Player 1 a)Determine the range of values for x...
Suppose we have a game where S 1 = { U,D } and S 2 =...
Suppose we have a game where S 1 = { U,D } and S 2 = { L,R } . If Player 1 plays U, then her payoff is ? regardless of Player 2’s choice of strategy. Player 1’s other payoffs are u 1 ( D,L ) = 0 and u 1 ( D,R ) = 12. You may choose any numbers you like for Player 2 because we are only concerned with Player 1’s payoff. a.) Draw the normal-form...
The next two questions will refer to the following game table: Player 2 X Y A...
The next two questions will refer to the following game table: Player 2 X Y A 2, 3 6, 1 Player 1 B 4, 2 1, 3 C 3, 1 2, 4 Question1 Which of Player 1's pure strategies is non-rationalizable, in a mixed-strategy context? Group of answer choices A B C Question2 Using your answer to the previous question, find all of this game's mixed-strategy Nash equilibria. *If you used graphs to help you answer the previous question and...
There are two players. First, Player 1 chooses Yes or No. If Player 1 chooses No,...
There are two players. First, Player 1 chooses Yes or No. If Player 1 chooses No, the game ends and each player gets a payoff of 1.5. If Player 1 chooses Yes, then the following simultaneous-move battle of the sexes game is played: Player 2 O F Player 1 O (2,1) (0,0) F (0,0) (1,2) Using backward induction to find the Mixed-Strategy Subgame-Perfect Equilibrium.
A game has two players. Each player has two possible strategies. One strategy is Cooperate, the...
A game has two players. Each player has two possible strategies. One strategy is Cooperate, the other is Defect. Each player writes on a piece of paper either a C for cooperate or a D for defect. If both players write C, they each get a payoff of $100. If both players write D, they each get a payoff of 0. If one player writes C and the other player writes D, the cooperating player gets a payoff of S...
1. Find the orthogonal projection of the matrix [[3,2][4,5]] onto the space of diagonal 2x2 matrices...
1. Find the orthogonal projection of the matrix [[3,2][4,5]] onto the space of diagonal 2x2 matrices of the form lambda?I.   [[4.5,0][0,4.5]]  [[5.5,0][0,5.5]]  [[4,0][0,4]]  [[3.5,0][0,3.5]]  [[5,0][0,5]]  [[1.5,0][0,1.5]] 2. Find the orthogonal projection of the matrix [[2,1][2,6]] onto the space of symmetric 2x2 matrices of trace 0.   [[-1,3][3,1]]  [[1.5,1][1,-1.5]]  [[0,4][4,0]]  [[3,3.5][3.5,-3]]  [[0,1.5][1.5,0]]  [[-2,1.5][1.5,2]]  [[0.5,4.5][4.5,-0.5]]  [[-1,6][6,1]]  [[0,3.5][3.5,0]]  [[-1.5,3.5][3.5,1.5]] 3. Find the orthogonal projection of the matrix [[1,5][1,2]] onto the space of anti-symmetric 2x2 matrices.   [[0,-1] [1,0]]  [[0,2] [-2,0]]  [[0,-1.5] [1.5,0]]  [[0,2.5] [-2.5,0]]  [[0,0] [0,0]]  [[0,-0.5] [0.5,0]]  [[0,1] [-1,0]] [[0,1.5] [-1.5,0]]  [[0,-2.5] [2.5,0]]  [[0,0.5] [-0.5,0]] 4. Let p be the orthogonal projection of u=[40,-9,91]T onto the...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT