In the following mixed-strategy, static, zero-sum game, calculate the optimal value for x (proportion of times player X should raise 1 hand and the optimal value of y (the optimal proportion of times Player Y should raise 1 hand). The net payoffs for player X are recorded in the matrix below. Player X 1 hand 2 hands 1- x 1 hand -10 70 Player Y y 2 hands 10 -10 1- y

In the following mixed-strategy, static, zero-sum game, calculate the optimal value for x (proportion of times player X should raise 1 hand and the optimal value of y (the optimal proportion of times Player Y should raise 1 hand). The net payoffs for player X are recorded in the matrix below. Player X 1 hand 2 hands 1- x 1 hand -10 70 Player Y y 2 hands 10 -10 1- y

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.5P

See similar textbooks

Similar questions

6. Two players each pick a positive integer between 1 and 100. If the numbers are identical, noone wins. If the numbers differ by 1, the one with the lower number pays 1 to the opponent. If the difference is at least 2, the one with the higher number pays 2 to the opponent. What is the NE? Hint: Draw a sketch of the game matrix (while you can't consider all 100 strategies, at least consider the lowest 5-6 numbers) and think about dominated strategies.
GAME ZZZ B1 Player B A1 30, 30 Player A A2 20, 40 B2 40, 20 35, 35 In the Game ZZZ (see table above), all payoffs are listed with the row player's payoffs first and the column player's payoffs second. In this game, neither player has a dominant strategy. the Nash equilibrium does not maximize the total payoff. there is no Nash equilibrium. the Nash equilibrium maximizes the total payoff.
Consider the following extensive form game between player 1 and player 2. T B (2, 2) L R R (3, 1) (0, 0) (5, 0) (0, 1) (a). Find the normal form representation of this game. (show the bimatrix) (b). Find all pure strategy NE. (c). Which of these equilibria are subgame perfect?
Consider the below payoff matrix for a game of chicken. Two players drive their cars down the center of the road directly at each other. Each player chooses SWERVE or STAY. Staying wins you more payoff only if the other player swerves. Swerving loses face if the other player stays. However, the worst outcome is when both players stay. Stay Swerve Stay -0,-0 -6,6 Swerve 6,-6 9,9 Player 1 chooses rows and Player 2 chooses columns. Denote the probability of "Stay" for Player 1 as p and for Player 2 as 9. What is the value of p so that Player 2 is indifferent between Stay and Swerve? Write your answer as a decimal number with 2 decimal places (e.g. 0.05)
W X Y Z 47, 15| 39, 41 45, 53 12, 56 In equilibrium, what is the probability that player 1 will use the pure strategy X in this game?
8) Find the mixed strategy Nash equilibrium of the following normal form game. Player 2 T1 T2 T3 2, 3 3, 5 1, 1 Player 1 S2 1, 4 4, 3 0, 5 Player 1 attaches probability (S1, S2) = () and Player 2 attaches probability (T1, T2, T3) = ( ) Player 1 attaches probability (S1, S2) = (.) and Player 2 attaches probability (T1, T2, T3) = (qi, 42, 1 – q1 – 92) where q1 , and 0 < q2 S %3D Player 1 attaches probability (S1, S2) = (G,;) and Player 2 attaches probability (T1, T2, T1) = (qı.42, 1 – q1 – 42) where 0 < qi <, and q2 = 3. Player 1 attaches probability (S1, S) = (;, -) and player 2 attaches probability (T1, T2, T3) = (1.42, 1- q1- 42) where 0 s qı s and q2 =
(a) Consider a ROCK PAPER SCISSOR game. Two players indicate either Rock, Paper or Scissor simultaneously. The winner is determined by: Rock crushes Scissors, Paper covers Rock, and Scissor cut Paper. In the case of a tie, there is no payoff. In the case of a win, the winner collects 5 dollars. Write the payoff matrix for this game. (b) Find the optimal row and column strategies and the value of the matrix game. 3 2 4 -2 1 -4 5
A game involves two players: player A and player B. Player A has three strategies a1, a2 and a3 while player B has three strategies b1, b2 and b3. Player B b1 b2 b3 a1 -40,30 70,20 -10,120 Player A a2 40,60 80,80 60,20 a3 -30,40 -50,110 150, -70 Assuming that this is a one-time game, answer the following questions: Is there any dominant strategy for each player? What is the secure strategy of each player. What is the Nash equilibrium of the game?
QUESTION 9 D 2 C D D, D OD, C C, D C II C (2,2) (4,0) (0,4) (3,3) In the dynamic game represented by the graph above, the numbers inside paranthesis show the payoffs of Player 1 and Player 2, respectively. The Nash equilibrium of this game is for Player 1 to choose O C, C and Player 2 to choose
Consider a game in which there is $4 to be divided, and the first mover is only permitted to make one of three proposals: (a) $3 for the first mover and $1 for the second mover, (b) $2 for each, or (c) $1 for the first movier and $3 for the second mover. The second mover is shown the proposal and can either accept, in which case it is implemented, or reject and cause each to earn $0. Show this game in extensive (tree) form. Be sure to show the payoffs for each person, with the first mover listed on the left, for each of the six terminal nodes.
Consider the Normal Form Game characterized in the following figure: P1 \ P2 A1 A2 A3 A4 B1 B2 B3 B4 (-1,1) (0,0) (1,-1) (2,0) (-2,-2) (2,7) (-1,-1) (-1,1) (5,7) (3,5) (0,0) (0,8) (0,3) (-1,-1) (10,2) (0,0) Which is the set of rationalizable actions? O (A2, A4)x(B2, B3) O (A1, A2)x(B1, B2, B4) O (A1, A3)x(B1, B4) O (A1, A3, A4}x{B1, B3)
2- Consider the following game. Player 2 Player 1 U 12, 2 | 3, 9 5, 8 4, 2 D (a) Find all the Nash equilibria, pure and mixed. (b) Suppose that the payoff of the column player u:(D, L) is reduced from 8 to 6, but all other payoffs remain the same. Again, find all the pure- and mixed-strategy Nash equilibria. (c) Compare the mixed-strategy equilibria in parts (a) and (b). Did this worsening in one of player 2's payoffs change player 2's equilibrium mixed strategy? Did it change player l's? Give some intuition.