O 100.10 O 60.20 O 75.15 O 80.30 Question 26 Figure 1: Sequential Games) Use backwards induction to find the outcome of this game if Saudi Arabia goes first. Strategies for each player are choose a high or low level of oil output. Saudi Arabia high Nigeria Nigeria high low 100 75 60 Saudi Arabia Nigeria 80 10 15 20 30

O 100.10 O 60.20 O 75.15 O 80.30 Question 26 Figure 1: Sequential Games) Use backwards induction to find the outcome of this game if Saudi Arabia goes first. Strategies for each player are choose a high or low level of oil output. Saudi Arabia high Nigeria Nigeria high low 100 75 60 Saudi Arabia Nigeria 80 10 15 20 30

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?
Q2
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.
60B- What is the Nash equilibrium for this game and identify the profit each player gets at this solution 5 m
1. Consider the following game matrix. Player A Answer: Top Bottom Left a, b e, f Player B Right c, d g, h (a) If top and left are strictly dominant strategies, then what do we know the relationship of the parameters? (b) If (top, left) is a Nash equilibrium, then what do we know the relationship of the parameters? Answer: (c) If top and left are strictly dominant strategies, will (top, left) be a Nash equilibrium? Why? Answer: (d) If (top, left) is a Nash equilibrium, must the strategies be strictly dominant strategies? Why? Answer:
Only typed Answer
Please no written by hand and no emage
can you answer 20 please
I have attracted a picture of my question because I don't know how to insert a table, if possible, can you please answer the question in typing because I fell hard to understand hand written works, thanks
Asap
A 201.
3. Consider the following game: K Out 2 2 1 9 Player 1 Player 1 X In A Y Player 2 0 2 B 5 5 a) Does the game have perfect information? Why/why not? b) Circle the subgames. c) Find all backward induction solutions. d) Below are written five strategy profiles. One of them is a subgame perfect equilibrium; circle it! One of them is not a Nash equilibrium; write "X" across it! ((Out, X), A) ((Out, Y), A) ((In, Y),B) ((Out, Y), B) ((In, X),B)