3. Which is the Subgame Perfect Equilibrium of this game? [Here ((Not Play,Steal), (Trust)) indicates that player 1 chooses Not Play at the first decision node and Steal at the second decision node, and 2 chooses Trust at his unique decision node.] 1 Not Play Play 2 1 1 Trust Distrust 1 0 Steal Share 2 10 5 0 5 O a) ((Not play, Steal),(Distrust)) b) ((Not play, Share), (Distrust)) Oc) ((Not play, Steal), (Trust)) O d) ((Play, Steal), (Distrust)) e) ((Play, Share), (Trust))

3. Which is the Subgame Perfect Equilibrium of this game? [Here ((Not Play,Steal), (Trust)) indicates that player 1 chooses Not Play at the first decision node and Steal at the second decision node, and 2 chooses Trust at his unique decision node.] 1 Not Play Play 2 1 1 Trust Distrust 1 0 Steal Share 2 10 5 0 5 O a) ((Not play, Steal),(Distrust)) b) ((Not play, Share), (Distrust)) Oc) ((Not play, Steal), (Trust)) O d) ((Play, Steal), (Distrust)) e) ((Play, Share), (Trust))

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

rock paper scissors гock 0. -3 1 рарer 1. -1 scissors -1 3 0. (a) Show that xT= ( ) and yT= (3) together are not a Nash equilibrium 3 3 313 for this modified game. (b) Formulate a linear program that can be used to calculate a mixed strategy x € A(R) that maximises Rosemary's security level for this modified game. (c) Solve your linear program using the 2-phase simplex algorithm. You should use the format given in lectures. Give a mixed strategy x E A(R) that has an optimal security level for Rosemary and a mixed strategy y E A(C) that has an optimal security level for Colin.
Don't use ai to answer I will report your answer Solve it Asap with explanation and calculation
Two politicians from the same party decide whether to support or oppose the gov- ernment's environmental policy. Politician A prefers that they both support, but Politician B prefers that they both oppose. Both politicians agree that the party should have a coherent position and the worst outcome is that one supports and the other opposes the policy. (a) Formulate this situation as a strategic game - specify the players, actions, and payoffs (you can set-up a table of the actions and payoffs). (b) What are the Nash equilibria of this game? Explain your answer.
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.
1
6. The owner of an antique piece of furniture is looking to sell their good to a known buyer. The seller has a reservation value r whereas the buyer has valuation v > r. Suppose the buyer incurs a one-off transportation cost of t from travelling to the seller to purchase the good. Assume that r, vand t are known to both parties. The game proceeds in two stages: First, the buyer decides whether or not to travel to the seller's location in order to purchase. Second, if they travel then the seller makes a take-it-or-leave-it offer (ultimatum) of price p to the buyer, which the buyer then can either accept or reject. (a) Represent this game in extensive form (b) Find the seller's optimal offer in Stage 2 of this game given that the buyer has already travelled. Is it accepted or rejected? (c) Find a Subgame Perfect Equilibrium of this game. (d) Are there any Nash equilibria which are not subgame perfect? Give an example if one exists. (e) Suppose the seller could offer free delivery at a…
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…
1. Nash Equilibrium (a) Find all pure Nash Equilibria P1/P2 W X Y Z 9,9 0,7 5,5 1,1 7,0 0,0 4,2 7,7 5,5 2,4 0,0 1,1 1,1 7,7 1,1 0,0 A B C D (b) Consider the following picnic game. There are N players in the game each who can chose to bring food to the picnic or not. Let b;= {0, 1} be player i's choice of bringing food with 0 as not and 1 as yes. If they decide to bring food it comes at a cost c;(1) = 1 and no cost to bring food. Payoffs are sum of food brought minus individual cost. i. Write out the normal form matrix if N = 2 ii. If N = 2 find all pure Nash Equilibria iii. Find all pure Nash Equilibria in the general game
Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.
1
1. Consider the following sequential game: Left (3,5) Mary Go (6,4) Up Right John Stop (5.7) John (a) Draw the game tree of the game. John Go Down (4,1) Left Mary Stop (2,5) Right (6,-1) (John as player 1 and Mary as player 2) By backward induction, find a Nash equilibrium and the corresponding payoffs. 2. Eve and Noa start with $10 in each of their piles. They take turns choosing one of two actions, continue or stop, with Eve choosing first. Each time a player says continue, $10 will be removed from her pile, and $20 will be added to the other player's pile. The game automatically stops when the total amount in their piles reaches $60. (Eve as player 1 and Noa as player 2) (b) By backward induction, find a Nash equilibrium and the corresponding payoffs.
I need both answers typing clear urjent no chatgpt i will used 5 upvotes