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: scissors rock paper -1 rock 0 paper 1 0 scissors -1 1 -1 2. Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper scissors -3 1 rock 0 paper 1 0 scissors (a) Show that x¹=(.) and yT=(..) together are not a Nash equilibrium for this modified game.

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: scissors rock paper -1 rock 0 paper 1 0 scissors -1 1 -1 2. Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper scissors -3 1 rock 0 paper 1 0 scissors (a) Show that x¹=(.) and yT=(..) together are not a Nash equilibrium for this modified game.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter15: Imperfect Competition

Section: Chapter Questions

Problem 15.7P

See similar textbooks

Similar questions

Make sure you clearly write your name and submission:. 1. 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 -1 0 1 rock 0 paper 1 scissors -1 (a) Show that this game does not have a pure Nash equilibrium. 1 X 3 (b) Show that…
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…
The following table contains the possible actions and payoffs of players 1 and 2. Player 1 U M D L 2,10 2,5 8,7 Player 2 C 5,2 11,8 8,4 R 5,4 2,9 8,3 This is a simultaneous move game. In a pure strategy Nash equilibrium of this game, Player 1 receives a payoff of ✓and player 2 receives a payoff of If, instead of playing simultaneously, player 2 moves first, then in the Nash equilibrium player 1 receives a payoff of ✓and player 2 receives a payoff of
Keith and Blake play a simultaneous one-shot game given by the following table: Blake Left Right Тop 5.00. -5.00 0.00, -6.00 Kelth Bottom 6.00,0.co -2.00, 8.00 As there is no unique pure strategy Nash equilibrium, assume that each player plays each of his chcices half of the time. What is the average payoff for Keith? (Round to two decimals if necessary.) What is the aver age payoff for Blake? |(Round to two decimals if necessary)
Keith and Blake play a simultaneous one-shot game given by the following table: Blake Left Right Keith Top Bottom 4.00, -5.00 0.00, -6.00 5.00, 0.00 -2.00, 7.00 As there is no unique pure strategy Nash equilibrium, assume that each player plays each of his choices half of the time. What is the average payoff for Keith? | What is the average payoff for Blake? (Round to two decimals if necessary.) (Round to two decimals if necessary.)
Normal Form Game: The table below provides a normal form, 2 x 2 game. The players are Column and Row. Column can choose either LEFT or RIGHT, and Row can choose either UP or DOWN. Their payoffs for each combination of moves are provided in the four boxes. Column Row UP DOWN The combination of moves (UP, LEFT) is a Nash-Equilibrium. A. False O B. True 2 LEFT -1 -7 3 6 RIGHT -5 -10
2. Consider the following game. Two criminals are thinking about pulling off a bank robbery. The take from the bank would be $20,000 each, but the job requires two people (one to rob the bank and one to drive the getaway car. Each criminal could instead rob a liquor store. The take from robing a liquor store is only $1000 but can be done with one person acting alone. Write the payoff matrix of this game Player A Bank job Liqour store Player B Bank job Liquor store a. What are the Nash equilibria in this game? b. Explain why there can be multiple equilibria in this game. c. How the game will be played if mixed strategies are allowed? Discuss.
The following payoff matrix represents a simultaneous-move game between two players: Kay and Jack. Each player has two choices: Black or White. The first number in each cell is the payoff to Kay, and the second number is the payoff to Jack. Jay Black White 50, 30, Black 50 30 Кay 45, 40, White 30 50 Refer to the scenario above. Which is true? a. This game has a dominant strategy equilibrium. b. This game has two dominant strategy equilibria. c. This game has two Nash equilibria. d. This game has one Nash equilibrium.
II. Determine which of the following two-person zero-sum games are strictly determinable and fair. Give the optimum strategies for each player in the case of it being strictly determinable. a- Player A Player B B1 B2 B3 A1 8 2 4 A2 5 -1 3 b. II II V V I -4 -2 -2 1 A II 1 -1 III -6 -5 -2 -4 4 IV 3 1 -6 0 -8 3.
Consider the following simultaneous game: Player 1 U D Player 2 L 20,-10 -10, 20 R -10, 20 20,-10 Please indicate whether each of the following statements is true or false. Player 1 has a dominant strategy. This game has a Nash equilibrium. This game has a Nash equilibrium in pure strategies. Player 1's best response is D if player 2 plays R.
. Find the Nash equilibrium of the following modified Rock-Paper-Scissors game: • When rock (R) beats scissors (S), the winner’s payoff is 10 and the loser’s payoff is −10. • When paper (P) beats rock, the winner’s payoff is 5 and the loser’s payoff is −5. • When scissors beats paper, the winner’s payoff is 2 and the loser’s payoff is −2. • In case of ties, both players receive 0 payoff. You are suposed to create a system of equations and then solve for them and find 3 probabilities- please show how to do that
2. Consider the two-by-two bimatrix game listed below: Left Right (2,-2) (1,-1) Up Down (3,-3) (-1,1) where the player "Row" chooses the action "up" or "down" and the player "Column" chooses the action "left" or "right". Describe a mixed strategy Nash Equilibrium for this game.