[39] Consider the following dynamic game: Player 1 moves first, choosing between strategies A and B. If 1 chooses A, then player 2 moves, choosing between strategies C and D. If 1 chooses B, then 2 chooses between E and F. If 2 chooses E, the game ends. If 2 chooses F, the game continues, with 1 choosing between G and H. The payoffs are indicated in parentheses at the bottom of the game tree, with 1's payoffs 1st and 2's payoffs 2nd.

[39] Consider the following dynamic game: Player 1 moves first, choosing between strategies A and B. If 1 chooses A, then player 2 moves, choosing between strategies C and D. If 1 chooses B, then 2 chooses between E and F. If 2 chooses E, the game ends. If 2 chooses F, the game continues, with 1 choosing between G and H. The payoffs are indicated in parentheses at the bottom of the game tree, with 1's payoffs 1st and 2's payoffs 2nd.

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

5. Consider the following Extended Form game where P1 stands for Player one and P2 stands for player two with A, B and A', B' being their respective strategies. A' (1,1) P2 B' (2,3) P1 A' B (4,5) P2 What is the set of Nash Equilibria? Clearly explain your answer. Full-screen Snip B' (6,7)
2. Consider the two-player strategic form game represented in the following payoff table: t 1 m b 7,2 1,2 3,7 2 M 2,4 3,4 1,6 R 1,3 7,1 4,2 Player 1 chooses between rows, S₁ = {t, m, b), and receives the first listed payoff in each cell. Player 2 chooses between columns, S₂ = {L, M, R), and receives the second listed payoff in each cell. a. Does either player have a strictly dominant strategy? Explain. b. Explaining your steps carefully, identify the set of rationalizable strategies in this game. c. Making sure to explain your solution method, solve for all pure strategy Nash equilibria in this game.
Refer to Table Left-Right-ZigZag. How many pure strategy Nash equilibria does this game have? Table: Left-Right-ZigZag Player 1 Drive left Driver right Zigzag 1) 1 2) 2 3) 3 4) 4 5) None of the above. Drive left (1,1) (-1,-1) (0,0) Player 2 Driver right (-1,-1) (1,1) (0,0) Zigzag (0,0) (0,0) (0,0)
8.8
Consider a Prisoners' Dilemma game involving two players, N = {1,2}, each of whom may choose either to co-operate (C) or to defect (D). The payoffs this game are illustrated in the below table. Player 1 receives the first listed payoff in each cell while player 2 receives the second listed payoff in each cell. 2 с 3,3 4,0 D 0,4 1, 1 a. Solve for the pure strategy Nash equilibrium of this static game. Are the players able to co-operate with one another? Explain why or why not. Suppose now that the above game is repeated infinitely many times and let 8 > 0 denote the common discount factor between periods. Suppose that the two players make the following agreement: "Play C in every period. If D is ever played, play D in every period thereafter." b. Explain how the one-deviation principle can be used to check whether the above agreement represents a subgame perfect Nash equilibrium of the infinitely repeated game. c. Use the method described in part b. of this question to calculate the…
See the extensive form game in the image attached (the payoffs of player 1 are written on top and the payoffs of player 2 are on the bottom). a) Write this game in normal form (a player's strategy is a complete contingent plan that tells them what to play at each of their information sets) (b) Find all the Nash equilibria of the normal form game from part (a)
John and Paul are walking in the woods one day when suddenly an angry bear emerges from the underbrush. They each can do one of two things: run away or stand and fight. If one of them runs away and the other fights, then the one who ran will get away unharmed (payoff of 0) while the one who fights will be killed (payoff -200). If they both run, then the bear will chase down one of them and eat them to death but the other one will get away unharmed. Assuming they don't know which one will escape we will call this a payoff of -100 for both. If they BOTH fight, then they will successfully drive off the bear but they may be injured in the process (payoff -20). Construct a payoff matrix for this game and identify the pure strategy Nash equilibrium. (Indicate it with words not with a circle!)
Team 2 plays A Team 2 plays B Team 2 plays C Team 1 plays A 9, 9 8, 12 6, 6 Team 1 plays B 6, 6 0, 7 5, 5 Team 1 plays C 12, 8 10, 10 7,0 Consider the simultaneous move game above in which two teams are competing against each other. Which of the following statements are true? In all Nash Equilibria of the game Team 2 plays B This game has two Nash Equilibria Team 1's best response to team 2 playing B is to play A. O None of the other answers are correct This game has a mixed strategy Nash Equilibria where a player randomizes over multiple options.
Please help with #2
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.
Solve parts 1(d) and 1(e) ONLY
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.