Solve the matrix game. -2 3 1 1 -1 -2 -3 -3 2 The optimal strategy for the row player is P*=______ (Type an integer or simplified fraction for each matrix element.) The optimal strategy for the column player is Q*=_______ (Type an integer or simplified fraction for each matrix element.) The value for the game is v=__________ (Type an integer or a simplified fraction.)

Solve the matrix game. -2 3 1 1 -1 -2 -3 -3 2 The optimal strategy for the row player is P=__ (Type an integer or simplified fraction for each matrix element.) The optimal strategy for the column player is Q=_ (Type an integer or simplified fraction for each matrix element.) The value for the game is v=________ (Type an integer or a simplified fraction.)

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 5E

See similar textbooks

Similar questions

In the coin game, two players begin with 13 coins. Players take turns to remove coins. At each turn each player is allowed to remove one, two, or three coins. The winner is the last player to remove coin(s). Suppose there are 9 coins remaining and it is your turn to remove coin(s). Your best strategy is to remove how many coins? a. 0 b. 1 c. 2 d. 3
Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?
Game Theory a) Consider the following game represented by the game tree below. If you observe Blue Bank playing medium and Green Bank playing bottom, would you be surprised by their choices? Carefully explain why or why not. b) Now assume that Blue and Green Banks play the game with the same actions and payoffs as in a) but they make their choices simultaneously. What is the payoff matrix for this new game? What do you predict will happen in the game? Explain. c) Assume that the game from part a) is played five times, i.e. Blue and Green Banks play a repeated game with the stage game described in a). What do you predict will happen in the game? Explain.
A game is played as follows: First Player 1 decides (Y or N) whether or not to play.If she chooses N, the game ends. If she chooses Y, then Player 2 decides (Y or N) whetheror not to play. If he chooses N the game ends. If he chooses Y, then they go ahead and playanother game with the payoffs shown below. A player who opts out by choosing N gets 2 andthe other player gets 0. Draw the tree of this game and then find the two subgame-perfect Nashequilibria.
6 Two people will select a policy that affects both of them by applying a "veto" in a sequential and alternate manner, that is: person 1 begins to veto a policy and then person 2 exercises his "veto" with the remaining policies; the process repeats until only one policy remains. Assume that there are 3 policies: X,Y,Z, and that person 1 prefers X to Y to Z and person 2 prefers Z to Y to X. a. Represents the game extensively b. Give the number of subgames C. Indicate the total strategies of the players d. find all subgame perfect nash equilibria e. Find all Nash Equilibriums.
1. Suppose Company A is about to play a game with Company B. The following facts are known about the two players. The first Company (Company A) is a row player and uses three different strategies i.e. (Strategy X, Strategy Y and Strategy Z). Whereas the column player (Company B) has two different strategies i.e. (M and N) that can be used accordingly. The payoff matrix is given in the table below. Player B Player A M N X -5 3 Y 3 -7 Z -6 5 Answer the following questions based on the information given above a. Determine the strategies of each firm using graphical technique b. Compute the value of the game.
H2. One day, Sam and Ryan play odds/evens to see who gets the last doughnut. On command, they each extend one or two fingers. If the sum is odd Sam wins the doughnut, if the sum is even Ryan wins the doughnut. Suppose the payoff from winning the doughnut is 1 and the payoff from losing is 0. a) Illustrate this interaction as a game in matrix form. b) Suppose that Sam thinks that Ryan will play one finger for sure? What will Sam play? Does Sam have reason to think that Ryan will play one finger for sure? c) Do either of them have a strictly dominated strategy? d) Find the pure strategy Nash equilibria of the game, if any. e) Suppose that Sam thinks that Ryan will play one finger or two fingers with even odds. Will Ryan play one finger for sure, play two fingers for sure or play each strategy with even odds? Does Sam have good reason to believe that Ryan will play one finger or two fingers with even odds?
3) Indicate whether the following statement is TRUE or FALSE and explain your answer: If one player is the leader in a game it means that s/he has the first move in the game. The key thing is that this move can be observed by the follower before making his/her own decision, otherwise it would be a simultaneous move game that cannot be solved by backwards induction.
You and a rival are engaged in a game in which there are three possible outcomes: you win, your rival wins (you lose), or the two of you tie. You get a payoff of 50 if you win, a payoff of 20 if you tie, and a payoff of 0 if you lose. What is your expected payoff in each of the following situations? (a) There is a 50% chance that the game ends in a tie, but only a 10% chance that you win. (There is thus a 40% chance that you lose.) (b) There is a 50–50 chance that you win or lose. There are no ties. (c) There is an 80% chance that you lose, a 10% chance that you win, and a 10% chance that you tie.
What is the payoff for both players in the SPNE of this game?-(2,5)-(3,4)- (2,2)- (5,1)- (1,7)
4 Consider an extensive game where player 1 starts with choosing of two actions, A or B. Player 2 observes player 1’s move and makes her move; if the move by player 1 is A, then player 2 can take three actions, X, Y or Z, if the move by player 1 is B, then player 2 can take of of two actions, U or V. Write down all teminal histories, proper subhistories, the player function and strategies of players in this game.
1. Solve for the mixed strategy Nash equilibrium of the game above. Explain carefully how you solve for it. 2. In the equilibrium you calculated above, what is the probability that both consoles are released in October? In December? What are the expected payoffs of firm A and of firm B in equilibrium?