Let G be the following static zero sum game. Rose Colin A B C D A 5 -7 B-4 -3 -2 1 C-1 7 3 2 D 5-2 6-3 4 -2 (a) Draw the movement diagram of G. (b) Using the method of iterated elimination of dominated strategies, find the smallest subgame of G from which the solution of G can be realized. (You do not have to find the solution of the game.)

Let G be the following static zero sum game. Rose Colin A B C D A 5 -7 B-4 -3 -2 1 C-1 7 3 2 D 5-2 6-3 4 -2 (a) Draw the movement diagram of G. (b) Using the method of iterated elimination of dominated strategies, find the smallest subgame of G from which the solution of G can be realized. (You do not have to find the solution of the game.)

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.1P

See similar textbooks

Similar questions

(a) Compute the Nash Equilibrium in pure strategies of the game above. (b) Compute the subgame perfect Nash equilibrium.(c) Compute the perfect Bayesian euilibrium. (I need help with how to solve these questions in detail)
Assume a simultaneous-move game. Firm B Low Price High Price Firm A Low Price 10,10 100,2 High Price 2,100 90, 90 What is the Nash equilibrium of the game?
Please help awnser 7. Game TheoryAlice and Bob playing the following 2x3 game. In the payoff matrix below, Alice’s payoffsare the first number and Bob’s are the second number.
What are the subgames in the following game ? find all the SPNE
1.Draw the extensive form representation of this game. 2. Find a subgame perfect equilibrium (SPE) of this game. focus on pure-strategies only.
Answer all questions, show all working. Consider the following game in strategic or normal form. A2 B2 C2 A1 1,0 1,2 -2,1 B1 6,2 0,3 2,3 C1 2,2 -2,1 2,3 Use the iterative elimination of strictly dominated strategies to reduce the game as much as possible. What is the set of rationalizable strategies for each player? What is/are Nash equilibrium(s) in this game? Explain the differences between cooperative and non- cooperative games. What are the fundamental hypotheses about the behavior of the persons in Game theory?
Address the following with suitable examples. (a)How Nash Equilibrium is achieved under Game Theory. (b)Find Nash Equilibrium in case of first-mover strategy. (c)Give some examples of games with two Nash Equilibriums? (d)Explain the concept of Nash Equilibrium in case of Non-Cooperative Games. (e)How expected Nash Equilibrium would be achieved in case of game with no Nash Equilibrium?
Could you put this game tree into game matrix form and find the nash equilibrium please. I will up vote
5. The following problem was first considered by John von Neumann and is a fundamentalresult game theory.A and B play the following game:A writes down either number 1 or number 2, and B must guess which one.If the number that A has written down is i and B has guessed correctly, B receives i units from A.If B makes a wrong guess, B pays 4/5 of a unit to A.First we consider the expected gain of player B.Suppose B guesses 1 with probability p and 2 with probability 1 −p.Let X1 denote B’s gain (or loss) in a game where A has written down 1.Let X2 denote B’s gain (or loss) in a game where A has written down 2.(a) Find the pmf of X1 and X2(b) Find B’s expected gain for these two cases, E[X1] and E[X2].(c) What value of p maximizes the minimum possible value of B’s expected gain?Now consider the expected loss of player ASuppose that A writes down 1 with probability q and 2 with probability 1 −q.Let Y1 be A’s loss (or gain) if B chooses number 1.Let Y2 be A’s loss (or gain) if B…
H3. Cooperation in a Finite Game We have seen that if we play the Prisoners' dilemma with finite repetition, there will be no cooperation in the subgame-perfect equilibrium. There are other games, however, when cooperation can be enforced for at least some time in a finite repetition as well. Give an example with explanation. (Hint: consider games with more than one Nash equilibria.)
1. Find all subgame perfect nash equilibrium 2. Find a nash equilibrium that is not SPNE, and explain why it is not an SPNE.
1. Draw a normal form for this tree. 2. Find all the subgames in the tree. 3. Find SPNE (Subgame Perfect Nash Equilibrium) of the tree and explain how it works.