Consider the following game in normal form. Player 2 L N Player A 8,11 0,0 1 B9,-1 0.5,5 Assume that the game will be repeated infinitely many times, and that player 2 is playing a grim trigger strategy. That is, he starts in the first period with L and plays L as long as player 1 does not deviate from A: If player 1 deviates from A, i.e., if player 1 plays B, player 2 chooses N in the next period and all future periods. How large needs to be, such that player 1 has no incentive to depart from A in the first period? 062/1/1/00 082 / 0. 062 1/1/000 062/1 None of the answers is correct.

Consider the following game in normal form. Player 2 L N Player A 8,11 0,0 1 B9,-1 0.5,5 Assume that the game will be repeated infinitely many times, and that player 2 is playing a grim trigger strategy. That is, he starts in the first period with L and plays L as long as player 1 does not deviate from A: If player 1 deviates from A, i.e., if player 1 plays B, player 2 chooses N in the next period and all future periods. How large needs to be, such that player 1 has no incentive to depart from A in the first period? 062/1/1/00 082 / 0. 062 1/1/000 062/1 None of the answers is correct.

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

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
4. Consider a normal form game with N= {1,2} and S= {A,B,C,D} x {W,X,Y,Z}. Assume that L1 allows to eliminate D and X, L2 allows to eliminate B and C, and L3 allows to eliminate Z. Provide payoffs that lead to this outcome. State the rationality assumptions explicitly.
3
2. Consider the following two-player game with two players: Adam and Eve. Adam A1 A2 A3 A4 E1 6,3 5, 3 5, 0 2,0 E2 4,4 5, 4 3, 2 2, 3 Eve E3 4, 1 0,2 6, 1 3, 4 E4 3,0 5, 1 4,0 6₂ 1 a. Find the Iterated Elimination of Dominant Strategies Equilibrium for this game. Explain.
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.
3
2. Consider the following "centipede game." The game starts with player 1 choosing be- tween terminate (T) and continue (C). If player 1 chooses C, the game proceeds with player 2 choosing between terminate (t) and continue (c). The two players choose be- tween terminate and continue in turn if the other player chooses continue until the terminal nodes with (player l's payoff, player 2's payoff) are reached as shown below. TTTT Player 1 Player 2 Player 1 Player 2 (3, 3) t (1, 1) (0, 3) (2, 2) (1, 4) (a) List all possible strategies of each player. (b) Transform the game tree into a normal-form matrix representation. (c) Find all pure-strategy Nash equilibria. (d) Find the unique pure-strategy subgame-perfect equilibrium.
Consider the infinite repeated two-player game where at each stage the play- ers play the non-zero-sum game given by A В A (5, 5) (0,7) В (7, 0) | (2, 2) (a) Consider the following strategies: SA: always play A. SB: always play B. • St: play A on the first stage, thereafter copy what the other player did in the preceding stage. Suppose that the total payoff involves a discount factor 8, and that both players are restricted to the pure strategies SA, SB, and sT. Determine the set of d for which (ST, ST) is a Nash equilibrium. (b) Use the one stage deviation principle to determine whether the pair (ST, ST) is a subgame perfect Nash equilibrium for some range of val- ues of 8.
Consider the following simultaneous game. a. b. C. d. Player 1 U Player 2 L 8,8 3,0 R 3,3 8,3 What are the pure-strategy Nash equilibria? Identify. Find whether there are any mixed-strategy equilibria. Assume now the game above is being modified as a sequential game where player 1 would move first and player 2 second. Find all Nash and subgame perfect equilibria for the game. Would a Nash equilibrium always be Pareto efficient? Use your answer in (a) to explain.
i need this in words not handwritten \or no pic pleaseee
A 201.
11. The following payoff table involves two players each of whom has three possible moves. L M N L 30,15 45,35 55,25 M 25,35 20,20 30,50 N 15,35 35,40 15,15 a. Are there any dominant strategies in this game?