Which one of the following descriptions is correct according to this Normal Form? * Opera Movie 0,0 Opera 2, 1 1, 2 0,0 Movie Battle of the Sexes O There's one strict dominated strategy for Player 1. O There's no weakly dominated strategy for Player 2. O Both Players have one weakly dominated strategy for each. O There are infinite dominated strategies for the players.

Which one of the following descriptions is correct according to this Normal Form? * Opera Movie 0,0 Opera 2, 1 1, 2 0,0 Movie Battle of the Sexes O There's one strict dominated strategy for Player 1. O There's no weakly dominated strategy for Player 2. O Both Players have one weakly dominated strategy for each. O There are infinite dominated strategies for the players.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.2P

See similar textbooks

Similar questions

(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)?
Consider the strategic voting game discussed at the endof this chapter, where we saw that the strategy profile (Bustamante, Schwarzenegger,Schwarzenegger) is a Nash equilibrium of the game. Show that (Bustamante, Schwarzeneg-ger, Schwarzenegger) is, in fact , the only rationalizable strategy profile. Do this by firstconsidering the dominated strategies of player L. (Basically, the question is asking youto find the outcome of the iterative elimination of strictly dominated strategies)
Consider the extensive form game portrayed below. The top number at aterminal node is player 1’s payoff, the middle number is player 2’s payoff,and the bottom number is player 3’s payoff.a. Derive the strategy set for each player. (Note: If you do not want to listall of the strategies, you can provide a general description of a player’sstrategy, give an example, and state how many strategies are in thestrategy set.)b. Derive all subgame perfect Nash equilibria. c. Derive a Nash equilibrium that is not a SPNE, and explain why it isnot a SPNE.
a) Find the Nash equilibria in the game (in pure and mixed strategies) and the associated payoffs for the players. b) Now assume that the game is extended in the following way: in the beginning Player 1 can decide whether to opt out (this choice is denoted by O) or whether to play the simultaneous-move game in a) (this choice is denoted by G). If Player 1 opts out (plays O) then both Player 1 and Player 2 get a payoff of 4 each and the game ends. If Player 1 decides to play G, then the simultaneous-move game is played. Find the pure-strategy Nash equilibria in this extended version of the game. (Hint: note that Player 1 now has 4 strategies and write the game up in a 4x2 matrix.) c) Write the game in (b) up in extensive form (a game tree). Identify the subgames of this game.
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?
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
4 Consider an extensive game where player 1 starts with choosing of two actions, A or B. Player 2 observes player 1’s move and makes her move; if the move by player 1 is A, then player 2 can take three actions, X, Y or Z, if the move by player 1 is B, then player 2 can take of of two actions, U or V. Write down all teminal histories, proper subhistories, the player function and strategies of players in this game.
Assume the following game situation: If Player A plays UP and Player B plays LEFT then Player A gets $1 and Player B gets $3. If Player A plays UP and Player B plays RIGHT then Player A gets $2 and Player B gets $5. If Player A plays DOWN and Player B plays LEFET then Player A gets $4 and Player B gets $2. If Player A plays DOWN and Player B plays RIGHT then Player A gets $1 and Player B gets $1 What is the Mixed Strategy Equilibrium for Player B? O. (LEFT, RIGHT) = (1/8, 3/8) O. (LEFT, RIGHT) = (1/4, 3/4) O. (LEFT, RIGHT) = (1/2, 1/2) O. (LEFT, RIGHT) = (3/8, 1/8)
Explain all will rate what is always true for a pure nash equilibrium of a two-person non zero-sum game A.No player can improve his payoff with a unilateral change of strategy B. it is a Pareto maximum of the payoff matrix C. No player can worsen the payoff of his opponent with a unilateral change of strategy D. It gives worse payoffs to both players than any berge equilibrium
Two players bargain over $20. Player 1 first proposes a split of(n, 20 - n), where n is an integer in {0, 1, ..., 20}. Player 2 can either accept or reject this proposal. If player accepts it, player 1 obtains $n and player 2 obtains $(20 - n). If player 2 rejects it, the money is taken away from them and both players will get $0. Question: Find two subgame perfect Nash equilibria of this game and state clearly each player's equilibrium strategies (recall that in a dynamic game, a player's strategy is a complete-contingent plan). Explain why the strategy profiles form a subgame perfect equilibrium.
A game is played as follows: First Player 1 decides (Y or N) whether or not to play.If she chooses N, the game ends. If she chooses Y, then Player 2 decides (Y or N) whetheror not to play. If he chooses N the game ends. If he chooses Y, then they go ahead and playanother game with the payoffs shown below. A player who opts out by choosing N gets 2 andthe other player gets 0. Draw the tree of this game and then find the two subgame-perfect Nashequilibria.
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