Suppose the game tree instead looks as follows R&D No R&D E No R&D &&D (0, 20). (10, 5). (10, 10). Copy it License Deny R&D In the revised game, how many strategies does I have? 4. 8. 16. 32. Acc. Fight 25,0 Acc. Fight Grant 10, 10 5,5 0, 20 -5,0 10,5 5, 20 What does the dashed line indicate? When I finds itself at one of the nodes that are connected by the dotted line, I will not know whether E has undertaken R&D or copied its product. After E moves, E will not know at which of the nodes that are connected by the dotted line I is located. The nodes that are connected by the dotted line lead to equivalent expected payoffs for I. The nodes that are connected by the dotted line lead to equivalent expected payoffs for E. 30, 5 In the revised game, what are the payoffs associated with the outcome that is derived through backward induction? Indeterminate, because we cannot resolve I's decisions without making additional assumptions about beliefs.

Suppose the game tree instead looks as follows R&D No R&D E No R&D &&D (0, 20). (10, 5). (10, 10). Copy it License Deny R&D In the revised game, how many strategies does I have? 4. 8. 16. 32. Acc. Fight 25,0 Acc. Fight Grant 10, 10 5,5 0, 20 -5,0 10,5 5, 20 What does the dashed line indicate? When I finds itself at one of the nodes that are connected by the dotted line, I will not know whether E has undertaken R&D or copied its product. After E moves, E will not know at which of the nodes that are connected by the dotted line I is located. The nodes that are connected by the dotted line lead to equivalent expected payoffs for I. The nodes that are connected by the dotted line lead to equivalent expected payoffs for E. 30, 5 In the revised game, what are the payoffs associated with the outcome that is derived through backward induction? Indeterminate, because we cannot resolve I's decisions without making additional assumptions about beliefs.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.7P

See similar textbooks

Similar questions

Consider the game with the payoffs below. Which of the possible outcomes are MORE efficient than the Nash Equilibrium (NE)? Note, they do NOT need to be Nash equilibria themselves, they just need to be more efficient than the NE. Multiple answers are possible, but not necessary. You need to check ALL correct answers for full credit. JILL High Medium LowMAGGIE Left 3,4 2,3 2,2Center 4,8 9,7 8,7Right 7,6 8,5 9,4Group of answer choices (Left, Low) There is no strategy combination that is more efficient than the Nash equilibrium for this game. (Right, Medium) (Left, High) (Center, Medium) (Center, High) (Center, Low) (Left, Medium) (Right, Low) (Right, High)
Consider the following coordination game: Player 2P1 Comedy Show Concert Comedy Show 11,5 0,0 Concert 0,0 2,2 a. Find the Nash equilibrium(s) for this game.b. Now assume Player 1 and Player 2 have distributional preferences. Specifically, both people greatly care about the utility of the other person. In fact, they place equal weight on their outcome and the other person’soutcome, ρ = σ = ½. Find the Nash equilibrium(s) with these utilitarianpreferences.c. Now consider the case where Player1 and Player2 do not like each other. Specifically, any positive outcome for the other person is viewed as anegative outcome for the individual, ρ = σ = -1. Find the Nashequilibrium(s) with these envious preferences.
E3 Bayesian Game]. Consider a Bayesian game described by a following payoff matrix. Please solve (show your solution). 1. Enumerate all pure strategies for each player. 2. Suppose that player 1 observes his type ?1 = 3. How does player 1 think of the probability of ?2? 3. Find a (pure strategy) Bayesian Nash equilibrium.
Consider the strategic form game shown. a. Assume that both players are rational. What happens?b. Assume that both players are rational and that each believes that theother is rational. What happens?c. Find the strategies that survive the ISDS.
Mohamed and Kate each pick an integer number between 1 and 3 (inclusive). They make their choices sequentially.Mohamed is the first player and Kate the second player. If they pick the same number each receives a payoff equal to the number they named. If they pick a different number, they get nothing. What is the SPE of the game? a. Mohamed chooses 3 and Kate is indifferent between 1, 2 and 3. b. Mohamed chooses 3 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2, and 3 if Mohamed chooses 3. c. Mohamed chooses 1 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2 and 3 if Mohamed chooses 3. d. Mohamed chooses 3 and Kate chooses 3.
on 8.1 Consider the following game: Player 1 A C D 7,6 5,8 0,0 Player 2 E 5,8 7,6 1, 1 F 0,0 1,1 4,4 a. Find the pure-strategy Nash equilibria (if any). b. Find the mixed-strategy Nash equilibrium in which each player randomizes over just the first two actions. c. Compute players' expected payoffs in the equilibria found in parts (a) and (b). d. Draw the extensive form for this game.
For the operating systems game, let us now assume the intrinsic superiorityof Mac is not as great and that network effects are stronger for Windows.These modifications are reflected in different payoffs. Now, the payoff fromadopting Windows is 50 X w and from adopting Mac is 15 + 5 X m;n consumers are simultaneously deciding between Windows and Mac.a. Find all Nash equilibria.b. With these new payoffs, let us now suppose that a third option exists,which is to not buy either operating system; it has a payoff of 1,000.Consumers simultaneously decide among Windows, Mac, and nooperating system. Find all Nash equilibria.
6 Two people will select a policy that affects both of them by applying a "veto" in a sequential and alternate manner, that is: person 1 begins to veto a policy and then person 2 exercises his "veto" with the remaining policies; the process repeats until only one policy remains. Assume that there are 3 policies: X,Y,Z, and that person 1 prefers X to Y to Z and person 2 prefers Z to Y to X. a. Represents the game extensively b. Give the number of subgames C. Indicate the total strategies of the players d. find all subgame perfect nash equilibria e. Find all Nash Equilibriums.
4. Correlated EquilibriaConstruct an example (not one from class or the reading) of a Normal form game with a correlated equilibrium that is not a Nash equilibrium.
Paramter y = 0 If ⟨a, d⟩ is played in the first period and ⟨b, e⟩ is played in the second period, whatis the resulting (repeated game) payoff for the row player?
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.
Determine the optimum strategies and the value of the game with the followingpayoff matrix of player A where A1, A2 are the strategies for player A and B1, B2 are for player B.B1 B2A1 5 1A2 3 4