You are given the payoff matrix below. B1 B2 B3 A1 1 Q 6 A2 P 5 10 A3 6 2 3 a. Determine the range of values of P and Q in order for Player A to choose strategy A2 and Player B to choose strategy B2. b. Solve the problem in the perspective of the opponent. Are the ranges the same? c. What are the values of the game for (a) and (b)?

You are given the payoff matrix below. B1 B2 B3 A1 1 Q 6 A2 P 5 10 A3 6 2 3 a. Determine the range of values of P and Q in order for Player A to choose strategy A2 and Player B to choose strategy B2. b. Solve the problem in the perspective of the opponent. Are the ranges the same? c. What are the values of the game for (a) and (b)?

Managerial Economics: Applications, Strategies and Tactics (MindTap Course List)

14th Edition

ISBN:9781305506381

Author:James R. McGuigan, R. Charles Moyer, Frederick H.deB. Harris

Publisher:James R. McGuigan, R. Charles Moyer, Frederick H.deB. Harris

Chapter13: best-practice Tactics: Game Theory

Section: Chapter Questions

Problem 2E

See similar textbooks

Similar questions

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.
Design the payoffff matrix of a game with no Nash Equilibria. The game should have 2 players, 2 strategies for each player, and the payoffffs for each player should be either 0 or 1.
What is the payoff to player 2 under the strategy profile (AK,D,FL) in this game?What is the payoff to player 3 under the strategy profile (BK,C,FM) in this game?
Consider a normal form game in which player 1 has three strategies, A1, B1, C1 and player 2 has three strategies, A2, B2, C2. Suppose that A1 is a best response to B2, B1 is a best response to A2, A2 is a best response to B1, and B2 is a best response to A1. Do we know with certainty whether A1 is rationalizable or not?
The bimatrix represents a simultaneous move game between Rowena and Colin. Rowena's payoff is the left number in each cell. ROWENA Up Down 0.25Left +0.75Right 0.65Left +0.35Right Find Colin's mixed strategy that makes Rowena indifferent between a pure strategy of playing Up and a pure strategy of playing Down. 0.5Left +0.5Right Left 1,16 2,20 0.45Left +0.55Right COLIN Right 4,6 3,40
Question 1 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). 1. Determine the range of values for x such that Player 2 has a strictly dominant strategy.
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)
4. You have probably had the experience of trying to avoid encountering someone, whom we will call Rocky. In this instance, Rocky is trying to find you. It is Saturday night and you are choosing which of two possible parties to attend. You like Party 1 better and, if Rocky goes to the other party, you get a payoff 20 at Party 1. If Rocky attends Party 1, however, you are going to be uncomfortable and get a payoff of 5. Similarly, Party 2 gives you a payoff of 15, unless Rocky attends, in which case the payoff is 0. Rocky likes Party 2 better, but he is likes you. He values Party 2 at 10, Party 1 at 5, and your presence at either party that he attends is worth an additional payoff of 10. You and Rocky both know each others strategy space (which party to attend) and payoffs functions.
i. ii. QUESTION ONE A. A Nash equilibrium is a strategy profile such that every player's strategy is the best response to all the other players. It requires that each player makes a best response and that expectations regarding the play of other players are correct. Below is the table showing strategies and payoff for Player 1 and Player 2. PLAYER 1 R1 R2 R3 R4 C1 0,7 5,2 7,0 6,6 C2 2,5 3,3 2,5 2,2 PLAYER 2 C3 7,0 5,2 0,7 4,4 CA 6,6 2,2 4,4 10,4 REQUIRED; Transform the normal form game above into an imperfect extensive game form Find the Nash equilibrium for the game above using iterative deletion of strictly dominated strategies. Find the Nash equilibrium using brute force or cell by cell inspection.
QUESTION 9 Consider the following sequential entry deterrance game. Player 1 plays first, and then Player 2 plays after observing the choice of Player 1. At the bottom of the decision tree, the first number represents the payoff of Player 1, while the second number represents the payoff of Player 2. Player 2 L (2,4) a Player 1 R (4,2) In this game, Player 2 has an incentive to threaten L, which would be credible. an incentive to threaten R, which wouldn't be credible. an incentive to threaten L, which wouldn't be credible. an incentive to threaten R, which would be credible. Player 2 (3,8)
Consider a game where player A moves first, choosing between Left and Right. Then, after observing player A’s choice, player B moves next choosing between Up and Down. Which of the following is true? This is a game where players A and B have the same number of strategies. Player A will get a higher payoff than player B as A moves first. This is game will only have one Nash equilibrium. This is a game of perfect information.
Player 2 Cooperate (1,000, 1,000) Cheat Player 1 (400, 2,000) Cooperate Cheat (2,000, 400) (500, 500) The above payoff matrix is for two players, each with two strategies. What is the Nash equilibrium of this game? Cheat and Cooperate Cheat and Cheat Cooperate and Cooperate Cooperate and Cheat