Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper scissors гock 0. -3 1. 0. раper scissors -1 (a) Show that xT= (,) and yT= (;,) together are not a Nash equilibrium 3 3 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.

Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper scissors гock 0. -3 1. 0. раper scissors -1 (a) Show that xT= (,) and yT= (;,) together are not a Nash equilibrium 3 3 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.

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

Consider the two period Repeated Prisoner's Dilemma Game where each player is interested in the SUM of the payoffs she gets in each period. Players see the outcome after the play in each period. (The period payoffs are 10,5,1,0.) (i) Write out this game in its strategic form. (ii) Find all Nash equilibria and all Subgame Perfect Nash Equilibria.
Explain Clearly.
Consider again the normal form of the Prisoner's dilemma game. Determine any Nash Equilibrium. Player 2 R (-10,-10) (-1,-25) (-25,-1) (-3,-3) C Player 1 R
Player 2 Left Right P1: $4 Player 1 Up P2: $1 P1: $10 Down P2:s10 Which of the Nash Equilibrium to this game are efficient? [Check all that apply] A) (up, left) B) (down, left) C None are efficient (D) (up right) E (down, right) Last saved 4:31:15 PM P1:S1 P2: $6 P1: $0 P2: $11 Grading
Consider the Normal Form Game characterized in the following figure: P1 \ P2 b1 b2 b3 a1 (1,2) (0,1) (0,3) a2 (3,-1) (1,1) (-1,0) a3 (2,2) (1,-1) (3,0) a4 (-5,1) (-1,0) (-3,-2) a5 (-3,3) (3,0) (2,4) What is the set of actions of player 1? O la 1, a2, a3, a4, a5) O (b1,b2, b3} O {a2, a3, a4) O (bl, b2}
Team 2 plays A Team 2 plays B Team 2 plays C Team 1 plays A 9, 9 8, 12 6, 6 Team 1 plays B 6, 6 0, 7 5, 5 Team 1 plays C 12, 8 10, 10 7,0 Consider the simultaneous move game above in which two teams are competing against each other. Which of the following statements are true? In all Nash Equilibria of the game Team 2 plays B This game has two Nash Equilibria Team 1's best response to team 2 playing B is to play A. O None of the other answers are correct This game has a mixed strategy Nash Equilibria where a player randomizes over multiple options.
Consider the following sequential game: 1 O D,L U.L U,R U D,R D (0,2) 2 L What is the subgame perfect Nash equilibrium of this game? R. (-1,-1) (1,1)
Solve parts 1(d) and 1(e) ONLY
(a) Calculate the rationalizable set R (b) Find all Nash equilibria (c) Find all mixed-strategy Nash equilibria fast
Consider the following two player game: Player 1 ABCD X 1,2 4,1 5,2 2,3 Player 2 Y 2,2 3.5 1 4,4 0.4 Z 5.1 3,3 7,0 7,5 a. Find the strategies that survive iterated elimination of weakly and strictly dominated strategies. b. Find the best responses to each strategy and find all (pure strategy) Nash equilibria.