uestion 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). A) Suppose that the value of x is such that player 2 has a strictly dominant strategy. Find the solution to the game. What solution concept did you use to solve the game? B) Suppose that the value of x is such the player 2 does NOT have a strictly dominant strategy. Find the solution to the game. What solution concept did you use to solve the game?

uestion 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). A) Suppose that the value of x is such that player 2 has a strictly dominant strategy. Find the solution to the game. What solution concept did you use to solve the game? B) Suppose that the value of x is such the player 2 does NOT have a strictly dominant strategy. Find the solution to the game. What solution concept did you use to solve the game?

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

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.
UNIT 9 CHAPTER 5 In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. Is there a pure strategy? Why or why not? Determine the optimal strategies and the value of this game. Does the game favor one player over the other? Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy.
In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. Is there a pure strategy? Why or why not? Determine the optimal strategies and the value of this game. Does the game favor one player over the other? Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy.
In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A.
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). Determine the range of values for x such that Player 2 has a strictly dominant strategy. 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)
Consider the following two-player game.First, player 1 selects a number x≥0. Player 2 observes x. Then, simultaneously andindependently, player 1 selects a number y1 and player 2 selects a number y2, at which pointthe game ends.Player 1’s payoff is: u1(x; y1) = −3y21 + 6y1y2 −13x2 + 8xPlayer 2’s payoff is: u2(y2) = 6y1y2 −6y22 + 12xy2Draw the game tree of this game and identify its Subgame Perfect Nash Equilibrium.
Consider the following sequential game. Player 1 plays first, and then Player 2 plays after observing the choice of Player 1 (if necessary). 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. In equilibrium, the payoff of Player 1 is ✓ and the payoff of player 2 is Player 2 L₂ (-1,8) L₁ Player 1 R₂ (100,1) R₁ (1,0)
CLASSES OF GAMES First, Alice chooses either action al or action a2. If Alice chooses action al, then she receives a payoff of 2 and Bob receives a payoff of 8. If Alice chooses action a2, then Bob chooses either action b1 or action b2. If Bob chooses action b1, then Alice receives a payoff of 0 and Bob receives a payoff of 2. If Bob chooses action b2, then Alice receives a payoff of 4 and Bob receives a payoff of 4. Which of the following are correct statements about the game described in the previous paragraph? (Mark all that are correct.) This game has perfect information. The strategy profile (a2,b1) is a Nash equilibrium of this game. Bob's backward induction payoff is 8. The strategy profile (al,b1) is a Nash equilibrium of this game. The strategy profile (a1,b2) is a Nash equilibrium of this game. The strategy profile (a2,b2) is a Nash equilibrium of this game. This is a bargaining game. This is a promise game. This is a threat game. Alice's backward induction payoff is 2.
3. Three politicians are voting on whether to allow themselves a salary increase of $3,500 per year. If they vote in favour of a raise, then they lose some public support, costing them each $1,500 per year. The salary increase passes if two or more politicians vote in favour of it. What is this game's Nash equilibrium (or equilibria)? Explain. There is no need to draw a payoff matrix. (20%)
Brett and Oliver are both going surfing. Each can choose between "North Beach" (N) and "South Beach" (S). North beach is better, but they both also prefer having the beach to themselves rather than sharing it with the other person. If Brett chooses N and Oliver N, the payoffs are (60, 60). If Brett chooses N and Oliver Chooses S, the payoffs are (70,30). If Brett chooses S and Oliver N the payoffs are (30,70). If they both choose S the payoffs are (20,20). Brett gets to choose first and tells Oliver, who then makes a decision. Which of the following is true? O The number of nash equillibrium in this game is less than the number of subgame perfect equillibrium O The number of nash equillibrium in this game is the same as the number of subgame perfect equillibrium O The number of nash equillibrium in this game is more than the number of subgame perfect equillibrium O There is no subgame perfect equilibrium in this game
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?
Alice chooses action a or action b, and her choice is observed by Bob. If Alice chooses action a, then Alice receives a payoff of 5 and Bob receives a payoff of 7. If Alice chooses action b, then Bob chooses action cor action d. If Bob chooses action c, then Alice receives a payoff of 10 and Bob receives a payoff of 5. If Bob chooses action d, then Alice receives a payoff of 0 and Bob receives a payoff of 3. Which of the following are correct statements about the game described in the previous paragraph? (Mark all that are correct.) O This game has imperfect information. O Alice's backward induction payoff is 5. O This is a promise game. O Alice's backward induction payoff is 0. O This is a prisoners' dilemma. O Bob's backward induction payoff is 5. O Bob's backward induction payoff is 3. O This is a threat game.