Consider a sequential-move version of a rock-paper-scissor game. Players sequentially form one of three shapes with an outstretched hand. These shapes are "rock", "paper", and "scissors". A player playing rock will beat another player playing chosen scissors, but will lose to one playing paper; a play of paper will lose to a play of scissors. If both players choose the same shape, the game is tied. Suppose the winner receives a payoff of 1 and the loser receives the payoff of -1. Both players receive zero payoff under a tie. Suppose Player 1 moves first and Player 2 moves afterwards. In this game, what is the subgame perfect Nash equilibrium payoff of Player 1? 1

Consider a sequential-move version of a rock-paper-scissor game. Players sequentially form one of three shapes with an outstretched hand. These shapes are "rock", "paper", and "scissors". A player playing rock will beat another player playing chosen scissors, but will lose to one playing paper; a play of paper will lose to a play of scissors. If both players choose the same shape, the game is tied. Suppose the winner receives a payoff of 1 and the loser receives the payoff of -1. Both players receive zero payoff under a tie. Suppose Player 1 moves first and Player 2 moves afterwards. In this game, what is the subgame perfect Nash equilibrium payoff of Player 1? 1

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

The following normal form representation of a racquetball game implies both players choose their strategies simultaneously. Nimah hits the ball, and Raina is moving at the same time to try and position herself where the ball will be. (please refer to figure provided) If the game is slowed down a little, giving Raina a chance to see what direction Nimah has hit to, what should happen?That is, what outcome would we predict for this as a sequential game when Nimah moves first?Choose one: A. Raina always wins the point. B. Nimah wins the point about half the time, and Raina wins about half the time. C. Nimah wins the points to the right, and Raina wins the points to the left. D. Nimah always wins the point.
Suppose we have two ice cream sellers, Blue Cool Ice Cream and Red Mango Ice Cream, deciding where to locate along a 1 kilometer long linear beach. Beachgoers are uniformly spread out everywhere along the beach. They do not like walking, and they view the ice cream from the two sellers as homogenous goods. Because of this, they will always buy from the nearest seller. The sellers cannot choose their price, only the location. A strategy for a player in this game is a distance between 0m and 1000m, which represents where the player will locate. For example, a distance of 0m is a strategy. The payoffs are the percentages of the market that each seller captures (depending on their two strategies). For example, if Blue Cool chooses 0m and Red Mango chooses 1000m, their payoffs are 50% and 50%. If the two sellers locate at exactly the same spot, they share the market and get 50% each. Suppose each player can only choose from 5 locations: 0m, 250m, 500m, 750m, 1000m. Is playing 0m is a…
If the players play pure strategies, the game has no Nash equilibrium. But what if they choose their moves randomly? Let each player instead opt for a mixed strategy instead of a pure strategy. The first will play action Z with probability p, and the second will play action L with probability q. At which pair (p, q) are the mixed strategies of the players in equilibrium? At which pair (p, q) does neither player want to change strategy? When are both strategies simultaneously the best response?
Once again, two ice cream truck vendors, A and B, are playing a simultaneous pricing game. If only one of the vendors prices low, he gets all the customers for a payoff of 12, while the other vendor gets no customers and a payoff of zero. If both vendors price high, they each get a payoff of 6. If both price low, they each get a payoff of 5. Suppose that the above game is repeated indefinitely, and together the vendors adopt a trigger strategy such that they would start charging the low price only if the other vendor charged a low price last time. Provided that the vendors stick to their new strategy, what would be the Nash equilibrium going forward? a) Both the vendors price high b) Both the vendors price low c) Vendor A prices high, vendor B prices low d) Vendor B prices high, vendor A prices low
Two firms are competing to establish one of two new wireless communication standards, A or B. A strategy is a choice of standard, and an outcome of this game is a choice of standard by each firm – for example, (A, B) represents the case where Firm 1 decides to develop standard A and Firm 2 develops standard B. Here, the first letter will always correspond to Firm 1’s decision, and the second letter to Firm 2’s decision. Firm 1 has the following preferences over outcomes, in order of highest to lowest preferred: it prefers (A, A) to (B, A) to (A, B) to (B, B). Firm 2 prefers (A, B) to (A, A) to (B, A) to (B, B). Suppose that firms simultaneously decide which standard to develop. What is the pure strategy Nash equilibrium?
Player 1 and player 2 are playing a simultaneous-move one-shot game, where player 1 can move "up" or "down" and player 2 can move "left" or "right" The payoffs for the game are shown in the payoff matrix. The first number of each cell represents player 1's payoff, and the second number is player 2's. Use the matrix to answer the questions below. Player 1 2nd attempt Part 1 Part 2 Which of the following outcomes is a pure strategy Nash equilibrium of this game? P = (1-P) = Up Down Part 3 9= Left -16, -18 -20,7 Choose one or more: A. There is no pure strategy Nash equilibrium in this game. OB. Player 1 plays up; player 2 plays left. OC. Player 1 plays up; player 2 plays right. □ D. Player 1 plays down; player 2 plays left. O E. Player 1 plays down; player 2 plays right. Player 2 Suppose player 1 assigns probability p to playing up and (1 - p) to playing down. What do p and (1-p) have to be such that player 2 is indifferent between playing left and right? Round all answers to two decimal…
Tyler and Pam are arrested and charged with armed robbery. The police interview both suspects separately about their involvement in the crime. Each suspect has to make a decision. They can betray the other suspect by confessing that they both committed the crime, or they can cooperate with the other suspect by remaining silent. The table shows the sentences that Tyler and Pam will receive given their choices. Use the table to answer the question. What will be the dominant strategy outcome for Tyler and Pam? They both get 10 years. Pam gets 5 years, and Tyler gets 15 years. O They both get 12 years. O Tyler gets 5 years, and Pam gets 15 years. Tyler Stay silent Confess Stay silent Pam gets 10 years Tyler gets 10 years Pam gets 15 years Pam Tyler gets 5 years Confess Pam gets 5 years Tyler gets 15 years Pam gets 12 years Tyler gets 12 years
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
Consider the following two player game. In each cell the first number refers to the payoff to Player 1 while the second number refers to the payoff to Player 2. Suppose the two players move simultaneously (at the same time). Which one of the following statements is CORRECT? Player #1 Player #2 Top Bottom Left 7.7 4.0 Right 0,4 4,4 O There are three equilibria in this game: two pure strategy equilibria at [Top, Left] and [Bottom, Right) and al third equilibrium in mixed strategies. In the mixed strategy equilibrium of this game. Player 1 should play Top with probability 2/5 and Bottom with probability 3/5; Player 2 should play Left with probability 2/5 and Right with probability 3/5. O There are three equilibria in this game; two pure strategy equilibria at (Top. Left) and (Bottom, Right) and a third equilibrium in mixed strategies. In the mixed strategy equilibrium of this game, both players should randomize over the strategies with probability and %. O There is a unique dominant…
Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Identify any dominated strategies in this game. If there are none, state this clearly.
Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly.
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…