on D Question 10 (b) SCARECROW N 10,1 S SCARECROW TINMAN n 15,4 N 2,3 SCARECROW TINMAN Choose the correct statement of this game. This game has a total of 5 subgames.. Scarecrow has a total of 2 available strategies. Tinman has a total of 8 available strategies. n 5 13,2 At the initial node. Scarecrow's best response is playing N. N S 14,5 TINMAN n S 11,0 12,2

on D Question 10 (b) SCARECROW N 10,1 S SCARECROW TINMAN n 15,4 N 2,3 SCARECROW TINMAN Choose the correct statement of this game. This game has a total of 5 subgames.. Scarecrow has a total of 2 available strategies. Tinman has a total of 8 available strategies. n 5 13,2 At the initial node. Scarecrow's best response is playing N. N S 14,5 TINMAN n S 11,0 12,2

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

7. N [0.75] B A [0.25] 1 E F 6 2 J K J K 12 3 9. 6 6. 1 In equilibrium, what is the probability that player 1 will use the pure strategy E in this game?
a W 3,5 3,4 8,4 0,0 3,3 8,9 y 0,1 5,9 9,8 Describe a strategy for player 1 that dominates x. O (1/3.0. 2/3) 1.0,0) O01.1) to
Consider the following game. Player S DE F A 10, 10 8, 7 8, 8 Player R B 8,7 9, 8 9, 12 C 9,8 7, 10 12, 7 Find the best response of step-2 Player S assuming that step-0 players (either Ror S) choose the strategy at random with equal probability. Select one: O a. F O b. E O c. B O d. A O e. C O f. D
Exercise 6.8. Consider the following extensive-form game with cardinal payoffs: 1 R O player pay 000 2 1 M 3 b 010 O player 3's payoff 1 2 221 2 000 0 0 (a) Find all the pure-strategy Nash equilibria. Which ones are also subgame perfect? (b) [This is a more challenging question] Prove that there is no mixed-strategy Nash equilibrium where Player 1 plays Mwith probability strictly between 0 and 1.
3. Consider the game below. С1 C2 C3 R1 1, 1 4, 6 8, 5 1, 2 5, 4 R2 R3 2, 6 2, 7 7, 6 0, 7 3.1. Does the game have any pure strategy NEs? 3.2. Check whether a mixed strategy NE exists in which A is mixing R1 and R2 with positive probabilities, playing R3 with zero probability, while B is mixing C1 and C3 with positive probabilities while playing C2 with zero probability. [Let (p1,P2, P3) be the probabilities with which A plays (R1, R2,R3) and let (q1,92, 93) be the probabilities with which B plays (C1, C2,C3). Make use of the following NE test: m* is a NE if for every player i, u;(mị , m²¿) = u;(Si, m²¡) for every si E S¡|m¡(sji) > 0 and u¡(m¡ ,m²¡) > u¡(s¡,m;) for every si E S¡ |m¡ (s¡) = 0. Hint: Each player must be indifferent between those of her pure strategies that are used (with positive probability) in her mixed strategy, and unused strategies must not yield a payoff that is higher than the payoff a player gets with her NE (mixed) strategy.] %3D
a 12, 9, 3 m 1 N b 10, 9, 4 7" 11, 15, 1 B 10, 20, 10 What's the possible outcome of this game?
2. Consider the following Bayesian game with two players. Both players move simultaneously and player 1 can choose either H or L, while player 2's options are G, M, and D. With probability 1/2 the payoffs are given by "Game 1" : GMD H 1,2 1,0 1,3 L 2,4 0,0 0,5 and with probability 1/2 the payoffs are according to "Game 2" : G |M|D H 1,2 1,3 1,0 L 2,4 0,5 0,0 (a) Find the Nash Equilibria when neither player knows which game is actually played. (b) Assume now that player 2 knows which one among the two games is actually being played. Check that the game has a unique Bayesian Nash Equilibrium.
1. Repeated Game Consider the following normal form game. D Player 1 E F A 10, 10 -12,-1 15, -1 Player 2 B -1, -12 8,8 -1,-1 C -1, 15 -1,-1 0,0 (a) Suppose this game is played once. Find all pure strategy Nash equilibria. (b) Now suppose the game is played two times without discounting. Find all strategy profile that can be played in the first period in a SPNE. (c) Now suppose the game is played T times without discounting, where T is a finite number. Find the smallest T such that (E,A) is played in the first period. (d) Now suppose the game is played infinitely many times and the players have a same discount factor 8 < 1. Find the smallest d that can support the SPNE in which (D,A) is played in every period along the equilibrium path. (Hint: Players use the Grim-Trigger Strategy where (F,C) is used as a punishment).
し(5,3) b I(2,2) も(0,0) (4,12) a (12.4) (0,0) i). List all subgame pertect Nash equilibria and name one Nash eqvilibrivm that is not subgame pertect i). How many strategies does playot and player 2 have?
0 E F 3 2 FIGURE 2 23 D G 2 H 0 1 (2) Two friends, Albert (A) and Berta (B), have to decide on going to one of three bars, Xenia's (X), Yara's (Y), or Zana's (Z). They decide to select a bar by alternatively vetoing bars until one remains. First Albert vetoes a bar. If at least two bars remain, then Berta vetoes another bar. That process continues until a single bar remains unvetoed. Suppose Albert prefers Xenia's to Yara's to Zana's and Berta prefers Zana's to Yara's to Xenia's. Assume that, for each of the two, going to their most preferred bar gives a utility of 2, going to their next preferred bar gives a utility of 1, and going to their least preferred bar gives a utility of 0. Model this as an extensive form game and find its Nash equilibria. Which of the Nash equilibria are subgame perfect?
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.
7 Find all subgame perfect equilibria of the game