Problem 2. Consider the given strategic form game. L M₂ R U 6,3 1,2 4,2 M₁ 1,1 5,2 6,4 D 4,4 4,3 0,2 (a) For player 1, can her strategy D be a best response against a mixed strategy o2 of player 2? (b) Is M₂ strictly dominated by a mixed strategy for player 2? (c) What would the result of the iterative elimination of strictly dominated strategies?

Problem 2. Consider the given strategic form game. L M₂ R U 6,3 1,2 4,2 M₁ 1,1 5,2 6,4 D 4,4 4,3 0,2 (a) For player 1, can her strategy D be a best response against a mixed strategy o2 of player 2? (b) Is M₂ strictly dominated by a mixed strategy for player 2? (c) What would the result of the iterative elimination of strictly dominated strategies?

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

12. Consider a game where each player picks a number from 0 to 60. The guess that is closest to half ofthe average of the chosen numbers wins a prize. If several peopleare equally close, then they share theprize. The game theory implies that (A) all players have dominant strategies to choose 0 (B) all players have dominant strategies to choose 30 (C) there is a Nash equilibrium where all players pick 0 (D) there is a Nash equilibrium where all players pick positive numbers 13. Behavioral data in such games suggests that (A) most subjects choose 0; (B) most subjects choose 30; (C) common answers include 30, 15, 7.5, and 0; (D) most subjects use randomization. Can you help me answer number 13 please?
Coansider the Gollowing game: L A 7,21,3 4,14,1 C1,57,01 two mixed strategy Nash equilibria. In one of them, player I plays the strategy 6,=(0,1,0). There ase the two equitibria, and both playe's expected what are what are payoffs? (Note: This is a tricky problem!)
4. Consider a two player game with Fred and Barney, who tal turns removing matchsticks from a pile. They start with 33 matchsticks, and Fred goes first. On each turn, ecach player may remove either one, two, three, four, or five matchsticks. The player to remove the last matchstick wins the game. What are the optimal strategies for each player? Who will win? b. Suppose now that they can remove up to six matchsticks, how will the optimal strategies change for- each player? a.
1. Consider the following two-player simultaneous move game, given in strategic form game by the following payoff matrix : U D L R 4,3 1,1 3,1 6,2 (a) Find all Nash Equilibria of the game. (b) Now, consider modifying the game such that player 1 plays first (and there is perfect information). Formalize the extensive form of this game. (c) Write the corresponding normal form of the new game and find all its pure strategy Nash Equilibria. (d) Find the only Subgame Perfect Nash Equilibrium of the new game.
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.
Consider the following two-player game with three options for each player. (Payouts are listed for the row player first, then the column player.) player Y layery 3,3 A 1,5 4,4 6,2 K 8,1 3,7 5,2 0,6 1,1 Find a mixed Nash equilibrium for this game. Solution suggestion: Use two variables per player. If p and are the probabilities of selecting the first two strategies, then 1-p-q is the probability of selecting the third strategy. You will need to solve a system of equations.
Find all NE of the stage game.(b) Consider a two-period game without discounting in which the stage game is played ineach period. Find all pure strategy SPNE.(c) What’s the min-max payoff of each player?(c1) Consider pure strategies only.(c2) Consider all strategies, including the mixed ones.(d) Now suppose the stage game is repeated infinitely many times. Use the Fudenberg-Maskin Folk theorem to find all possible values of payoff that can be supported as aSPNE.
3. Consider the following game in normal form. Player 1 is the "row" player with strate- gies a, b, c, d and Player 2 is the "column" player with strategies w, x, y, z. The game is presented in the following matrix: W x y Z 2,1 0,2 2,1 a 3,3 b 1,1 1,2 1,0 1,4 c 0,0 1,0 3,2 1,1 d 0,0 0,5 0,2 3,1 Find all the Nash equilibria in the game in pure strategies.
Consider the payoff matrix below, which describes a symmetric A B A 17,17 0,14 B 14,0 8,8 (a) Find all Nash equilibria of this game, including any mixed strategy equilibria. (b) Draw the expected payoff difference diagram for this game, including all the Nash equilibria you found in (a). is (c) What would you expect to occur most frequently when this game played as a lab experiment? Justify your answer using your answers from (a) and (b).
Consider the Collowing game: (15, 3,2) A (0,1,1) L A 7,21,3 (3,2,6) B B 14,114,1 マも (0,6,5) マ、 cl1,57,0| Ps (2,1,4} (6,3,8) two mixed strategy Nash equilibria. In one of them, player I plays the strategy 0,-(0,1,0). There are -(4.0,6) Pg (3,1,7) the two equitibria, and bath playe's erpected Subgame Perlect Nash Equilibaiom? IIf so, what a it? what Is there a are what are • Are there any non- Sobgame Perfect Nach If So, give payoffs? Equilibaia? an example. (Note: This is a tricky problem!)
If a 2 by 2 game has no mixed strategy Nash equilibrium then which of the following statements is true? O Any strategy is a best response. O Any strategy is rationalizable. No strategy is rationalizable. We can solve the game by iterated elimination of dominated strategies. O Players prefer not to mix whenever the other player mixes.
1. Static and Dynamic Game. Consider the following 2-by-2 game: C D 1A (1,10) (1,1) B (2, a) (0,1) (a) erwise, find the pure-strategy Nash equilibria, if any of this game. (There is no need to look for equilibria in mixed strategies) Assume for now that a = 2. Using dominant strategies or oth- (b) Now, consider the dynamic game in which player 1 moves before player 2, and the payoffs remain unchanged. i.: possible strategies for each player? Recall that a strategy profile for a player not at the initial node of the game tree must specify an action for the player at every node. Draw the game tree for this dynamic game. What are the ii "Find the backward-induction solution(s) to this game. Calculate the equilibrium payoffs for each player. Com- pared to the simultaneous game, is there a first-mover advantage or a ii. second-mover advantage? (c) Now, assume that a = 0 in the original static game. i. Find all the Nash equilibria in pure and mixed strategies. Denoting p the probability…