A two-player simultaneous-move game played by Player 1 and Player 2 has three strategies: rock, paper, and scissors. If both players choose the same strategy, they each get a payoff of 0. If one player chooses rock and one player chooses paper, the player who chose rock gets a payoff of -1 and the player who chose paper gets a payoff of 1. If one player chose rock and the other chose scissors, the player who chose rock gets a payoff of 1, and the player who chose scissors gets a payoff of -1. If one player chose scissors and the other chose paper, the player who chose scissors gets a payoff of 1, and the player who chose paper gets a payoff of -1. Write down the representation of this game in matrix form. Is there a pure-strategy Nash equilibrium of this game?

A two-player simultaneous-move game played by Player 1 and Player 2 has three strategies: rock, paper, and scissors. If both players choose the same strategy, they each get a payoff of 0. If one player chooses rock and one player chooses paper, the player who chose rock gets a payoff of -1 and the player who chose paper gets a payoff of 1. If one player chose rock and the other chose scissors, the player who chose rock gets a payoff of 1, and the player who chose scissors gets a payoff of -1. If one player chose scissors and the other chose paper, the player who chose scissors gets a payoff of 1, and the player who chose paper gets a payoff of -1. Write down the representation of this game in matrix form. Is there a pure-strategy Nash equilibrium of this game?

Managerial Economics: A Problem Solving Approach

5th Edition

ISBN:9781337106665

Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Publisher:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Chapter15: Strategic Games

Section: Chapter Questions

Problem 9MC

See similar textbooks

Similar questions

Suppose that two firms, firm A and firm B, are competing in the market. Assume that each firm has two strategies available: “no promotion” and “extensive promotion”. If both firms choose “no promotion”, each firm will get a payoff of 8000. If both firms choose “extensive promotion”, each firm will get a payoff of 5000. If one firm chooses “no promotion” and the other firm chooses “extensive promotion”, the firm that chooses “no promotion” will get a payoff of 4000 and the firm that chooses “extensive promotion” will get a payoff of 10000.a. Assume the game is a 2-players one-shot simultaneous game, please develop the normal form of this game by showing the players, the strategies and the payoffs. b. Follow part (a), determine the dominant strategy of firm A. c. Follow part (a), determine the dominant strategy of firm B. d. Follow part (a), determine the equilibrium of this game. e. If the game becomes an infinitely repeated game, what do you expect to happen?
Consider the following sequential move game played by three players, A, B and C. Player A moves first and chooses one of the following two payoff matrices, either Box 1 or Box 2. Following Player A's choice, Players B and C move simultaneously. Player B chooses one of two strategies, Top or Bottom, while Player C chooses one of two strategies, Left or Right. Player A; Box 1: Player B Player A; Box 2: Player B Top Bottom Top Bottom Player C Left 3,3,3 6,5,0 Player C Left 3,6,6 4, 10,0 Right 6,0,5 8, 1, 1 Right 4,0, 10 6,2,2 Each cell in the two boxes contains three numbers. The first number is the payoff to Player A, the second number is the payoff to Player B and the third number is the payoff to Player C. This implies that when choosing their respective strategies, Players B and C will consider the second and third payoff numbers respectively in each cell. Player A, of course, will focus on the first number in each cell in deciding which box to choose. What is the subgame perfect…
The first player can choose either U or D. If he chooses U, the second player has a choice of two strategies: L and R. If the second player moves L he obtains 1 and the first player gets 5. If the second player chooses R he obtains 2 units of payoff while the first player receives 1. Following a move D by the first player, both players engage in a simultaneous-move “Bach or Stravinsky” game (as it was described in class). Find the SPE of this game and write it down in a mixed and behavior form.
Two hunters are on a stag hunt. They split up in the forest and each have two strategies: hunt for a stag (S), or give up the stag hunt and instead hunt for rabbit (R). If they both hunt for a stag, they will succeed and each earn a payoff of 9. If one hunts for stag and the other gives up and hunts for rabbit, the stag hunter receives 0 and the rabbit hunter 8. If both hunt for rabbit then each receives 7. Compute all Nash equilibria for this game, called 'The Stag Hunt', depicted below. Which of these equilibria do you think is most likely to be played? Why? S R S 9,9 8,0 R 0,8 7,7
Alice and Betsy are playing a game in which each can play either of two strategies, leave or stay. If both play the strategy leave, then each gets a payoff of $400. If both play the strategy stay, then each gets a payoff of $800. If one plays stay and the other plays leave, then the one who plays stay gets a payoff of $C and the one who plays leave gets a payoff of $D. When is the outcome where both play leave a Nash equilibrium? a) never, since 800 > 400 b) when 400 > C and D > 800 but not when 800 > D c) whenever 400 > C d) when D > C and C > 400 e) whenever d < 800
In a two-player, one-shot, simultaneous-move game, each player can choose strategy A or strategy B. If both players choose strategy A, each earns a payoff of $400. If both players choose strategy B, each earns a payoff of $200. If player 1 chooses strategy A and player 2 chooses strategy B, then player 1 earns $100 and player 2 earns $600. If player 1 chooses strategy B and player 2 chooses strategy A, then player 1 earns $600 and player 2 earns $100. a. Write this game in normal form. b. Find each player’s dominant strategy, if it exists. c. Find the Nash equilibrium (or equilibria) of this game. d. Rank strategy pairs by aggregate payoff (highest to lowest). e. Can the outcome with the highest aggregate payoff be sustained in equilibrium? Why or why not?
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.
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?
the Consider a simultaneous-move integer game between two players: Marilyn and Noah. Each of player is required to announce a positive integer between 1 to 4. In other words, a player can announce 1, 2, 3, or 4. Two players announce their integers simultaneously. Notice that this game is different from the games we learned in class in that each player has four actions to take. The payoffs of the players in the game are specified as follows: (1) when the two announced integers are different, whoever reports the lower number pays $1 to the other player, so that the loser of the game has payoff -1 and the winner of the game has payoff 1; (2) when the two players announce the same integer, their payoffs are both O. What is Marilyn's maximin strategy? 01 02 03 O
Suppose that two players are playing the following game. Player 1 can choose either Top or Bottom, and Player 2 can choose either Left or Right. The payoffs are given in the following table: Player 1 Player 2 Left Right Top 6 1 9 4 Bottom 2 4 5 3 where the number on the left is the payoff to Player 1, and the number on the right is the payoff to Player 2. D) What is Player 1’s maximin strategy?E) What is Player 2’s maximin strategy?F) If the game were played with Player 1 moving first and Player 2 moving second, using the backward induction method we went over in class, what strategy will each player choose?
Consider the 2-player, zero-sum game "Rock, Paper, Scissors". Each player chooses one of 3 strategies: rock, paper, or scissors. Then, both players reveal their choices. The outcome is determined as follows. If both players choose the same strategy, neither player wins or loses anything. Otherwise: • "paper covers rock": if one player chooses paper and the other chooses rock, the player who chose paper wins and is paid 1 by the other player. "scissors cut paper": if one player chooses scissors and the other chooses paper, the player who chose scissors wins and is paid 1 by the other player. "rock breaks scissors": if one player chooses rock and the other player chooses scissors, the player who chose rock wins and is paid 1 by the other player. We can write the payoff matrix for this game as follows: rock paper scissors rock 0 -1 1 paper 1 0 scissors -1 1 -1 0 2. Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper…
John and Paul are walking in the woods one day when suddenly an angry bear emerges from the underbrush. They each can do one of two things: run away or stand and fight. If one of them runs away and the other fights, then the one who ran will get away unharmed (payoff of 0) while the one who fights will be killed (payoff -100). If they both run, then the bear will chase down one of them and eat them to death but the other one will get away unharmed. Assuming they don't know which one will escape we will call this a payoff of -50 for both. If they BOTH fight, then they will successfully drive off the bear but they may be injured in the process (payoff -10). Construct a payoff matrix for this game and identify the pure strategy Nash equilibrium. (Indicate it with words not with a circle!)