Consider the payoff matrix for a game depicted below. Player 1 selects the row and Player 2 selects the column.Up DownLeft 0,-1 2,3Right 1,2 0,1What is (are) the Nash equilibrium (equilibria)?Select one or more:□ a. Player 1 plays right; Player 2 plays upO b.Player 1 plays up; Player 2 plays rightOc. Player 1 plays up; Player 2 plays leftO d. Player 1 plays left; Player 2 plays upOe. Player 1 plays left; Player 2 plays downOf. Player 1 plays down; Player 2 plays rightOg. Player 1 plays right; Player 2 plays downOh. Player 1 plays down; Player 2 plays left

Dominant strategy is the strategy where the strategy does not change with the change in opponent's…

Consider the payoff matrix for a game depicted below. Player 1 selects the row and Player 2 selects the column. Up Down Left 0,-1 2,3 Right 1,2 0,1 What is (are) the Nash equilibrium (equilibria)? Select one or more: a. Player 1 plays right; Player 2 plays up b. Player 1 plays up; Player 2 plays right Oc. Player 1 plays up; Player 2 plays left Od. Player 1 plays left; Player 2 plays up e. Player 1 plays left; Player 2 plays down Of. Player 1 plays down; Player 2 plays right Og. Player 1 plays right; Player 2 plays down Oh. Player 1 plays down; Player 2 plays left

Consider the payoff matrix for a game depicted below. Player 1 selects the row and Player 2 selects the column. Up Down Left 0,-1 2,3 Right 1,2 0,1 What is (are) the Nash equilibrium (equilibria)? Select one or more: a. Player 1 plays right; Player 2 plays up b. Player 1 plays up; Player 2 plays right Oc. Player 1 plays up; Player 2 plays left Od. Player 1 plays left; Player 2 plays up e. Player 1 plays left; Player 2 plays down Of. Player 1 plays down; Player 2 plays right Og. Player 1 plays right; Player 2 plays down Oh. Player 1 plays down; Player 2 plays left

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.1P

See similar textbooks

Similar questions

Consider the payoff matrix for a game depicted below. Player 1 selects the row and Player 2 selects the column. Up Down Left 1, -1 -1, 1 Right -1, 1 1, -1 What is (are) the Nash equilibrium (equilibria)? Question 18Answer a. Player 1 plays right; Player 2 plays down b. Player 1 plays left; Player 2 plays down c. Player 1 plays down; Player 2 plays left d. Player 1 plays right; Player 2 plays up e. Player 1 plays up; Player 2 plays left f. There is no Nash equilibrium g. Player 1 plays down; Player 2 plays right h. Player 1 plays up; Player 2 plays right i. Player 1 plays left; Player 2 plays up
True or False?Please Explain Thoroughly: In a Nash equilibrium of a strategic game, each player must best respond to her opponents’ actions, therefore, no other action profile can be unanimously preferredby all the players to a Nash equilibrium.
Please no written by hand Two players bargain over how to split $10. Each player i ∈ {1, 2} choose a number si ∈ [0, 10] (which does not need to be an integer). Each player’s payoff is the money he receives. We consider two allocation rules. In each case, if s1 + s2 ≤ 10, each player gets his chosen amount si and the rest is destroyed. 1. In the first case, if s1 + s2 > 10, both players get zero. What are the (pure strategy) Nash equilibria? 2. In the second case, if s1 + s2 > 10 and s1 6= s2, the player who chose the smallest amount receives this amount and the other gets the rest. If s1 + s2 > 10 and s1 = s2, they both get $5. What are the (pure strategy) Nash equilibria? 3. Now suppose that s1 and s2 must be integers. Does this change the (pure strategy) Nash equilibria in either case?
Consider the following game: Player 2 In Out Player 1 In -2,-2 2, 0 Out 0, 2 0, 0 (a) What is the Nash equilibrium of this game, or what are the Nash equilibriaof this game? (b) Does either firm have a dominate strategy (a strategy that is always abest response)? Which? (c) Suppose Player 1 could move before Player 2 and Player 2 could observe Player 1’s move. What do you think would happen?
. 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
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
For the operating systems game, let us now assume the intrinsic superiorityof Mac is not as great and that network effects are stronger for Windows.These modifications are reflected in different payoffs. Now, the payoff fromadopting Windows is 50 X w and from adopting Mac is 15 + 5 X m;n consumers are simultaneously deciding between Windows and Mac.a. Find all Nash equilibria.b. With these new payoffs, let us now suppose that a third option exists,which is to not buy either operating system; it has a payoff of 1,000.Consumers simultaneously decide among Windows, Mac, and nooperating system. Find all Nash equilibria.
Consider the following game. There are two payers, Player 1 and Player 2. Player 1 chooses a row (10, 20, or 30), and Player 2 chooses a column (10/20/30). Payoffs are in the cells of the table, with those on the left going to Player 1 and those on the right going to player 2. For example, a payoff 100/200 would mean Player 1 receives 100 and Player 2 receives 200.What is [are] the Nash Equilibrium [Equilibria] of this game?A) (10/10) and (20/20)B) (30/30)C) (10/20) and (20/10)D) (20/20)E) (30/30)
Suppose two players play a two-period repeated game, where the stage game is the normal-form game shown below. Is there a subgame perfect Nash equilibrium in which the players select (A, X) in the first period? If so, fully describe such equilibrium. If not, explain why not. Player 1 has choice A, B; Player 2 has choice X, Y, Z. Payoff: (A,X)-(5,7), (A,Y)-(2,4), (A,Z)-(3,8), (B,X)-(1,4), (B,Y)-(3,5), (B,Z)-(1,4)
(a) Find all the Nash Equilibria, if there is any. (no explanation needed for this part (b) Does player 1 (choosing rows) have any dominant action? If yes, which action(s)? Any dominated action(s)? If yes, which ones? Answer the same questions for player 2, too. (c) If player 1 moves first (and player 2 moves next), what would be the sequentially rational equilibrium (draw the game tree and use backward induction)?What if player 2 moves first (and then player 1 moves next)? (d) Looking at your findings in (c), would player 1 want to move first or second or is she indifferent (the order doesn’t matter)?
PLAYER B LEFT RIGHT UP 5 FOR A, 30 FOR B 10 FOR A, 12 FOR B PLAYER A DOWN -2 FOR A, 10 FOR B 8 FOR A, 15 FOR B In the above game, the players are seeking to maximize the number they recieve. They choose at the same time. What is the Nash equillibrium? Player A will choose UP and player B will choose LEFT Player A will UP and player B will choose RIGHT Player A will choose DOWN and player B will choose LEFT Player A will choose DOWN and player B will choose RIGHT Player A will choose LEFT and player B will choose UP Player A will choose LEFT and player B will choose DOWN Player A will choose RIGHT and player B will choose UP Player A will choose RIGHT and player B will choose DOWN
Let us see the example of Juan and María given but modify their preferences. It is still the case that they are competitive and are deciding whether to show up at their mom’s house at 8:00 A.M., 9:00 A.M., 10:00 A.M., or 11:00 A.M. But now they don’t mind waking up early. Assume that the payoff is 1 if he or she shows up before the other sibling, it is 0 if he or she shows up after the other sibling, and it is 1 if they show up at the same time. The time of the morning does not matter. Find all Nash equilibria.