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.

Exploring Economics

8th Edition

ISBN:9781544336329

Author:Robert L. Sexton

Publisher:Robert L. Sexton

Chapter15: Oligopoly And Strategic Behavior

Section: Chapter Questions

Problem 17P

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.
Consider the following price game: Firm 1 Firm 2 High Low High 20, 20 12, 24 Low 24, 12 14, 14 Remark: In simultaneous move games (games with rows and columns) theconvention is to write the row player’s payoff first and the column player’spayoff second. (a) What is the Nash equilibrium of this game? Recall that for each playeryou should find the best response to each of the opponents’ strategies andunderline the associated payoff. Then look for a cell where both strategiesare best responses to each other. This is a Nash equilibrium. (b) Does either firm have a dominate strategy (a strategy that is always abest response)?
Consider the following game: Player 2 In Out Player 1 In -2,-2 2, 0 Out 0, 2 0, 0 (a) What is the Nash equilibrium of this game, or what are the Nash equilibriaof this game? (b) Does either firm have a dominate strategy (a strategy that is always abest response)? Which? (c) Suppose Player 1 could move before Player 2 and Player 2 could observe Player 1’s move. What do you think would happen?
2. Consider the following game. Two criminals are thinking about pulling off a bank robbery. The take from the bank would be $20,000 each, but the job requires two people (one to rob the bank and one to drive the getaway car. Each criminal could instead rob a liquor store. The take from robing a liquor store is only $1000 but can be done with one person acting alone. Write the payoff matrix of this game Player A Bank job Liqour store Player B Bank job Liquor store a. What are the Nash equilibria in this game? b. Explain why there can be multiple equilibria in this game. c. How the game will be played if mixed strategies are allowed? Discuss.
3 0: she makes a pront of $9 An is ISK AVCise and aunty she makes. Let P be the probability that it rains the day of the concert. Find the number P tha makes Ann indifferent between organizing the concert in the Club or at the Park. 8. Compute the mixed strategy Nash equilibrium of the game below: Bungle F2 # Zippy E Left Right DOD F4 Up 2,-1 R I 20 F3 $ BAG 3 4 -2,0 HOT % 5 F5 Down 3,1 T 4,-2 VO MacBook Air 6 F6 Y & 7 F7 * U 8
L 0 4 15.1 X₂ A M R 0 1 4 0 2 B L 4 0 с X3 M R 0 1 3 FIGURE 15.5 Exercise 15.1. Equilibrium Selection: Consider the extensive-form game in Figure 15.5. a. Find all the Bayesian Nash equilibria of this game. b. Which of the Bayesian Nash equilibria are also perfect Bayesian equi- libria? Why?
5. Consider a simultaneous game in which player A chooses one of two actions (Up or Down), and B chooses one of two actions (Left or Right). The game has the following payoff matrix, where the first payoff in each entry is for A and the second for B.(8 points) B Right Left 3,3 5,1 Down 2,2 4,4 a. Find the Nash equilibrium or equilibria. b. Which player, if any, has a dominant strategy? A Up
1) What are the Nash equilibria? Which one is unreasonable/non-credible threat? 2) What are the subgame perfect Nash equilibria? Does SPNE concept eliminate the unreasonable Nash equilibrium?
Solve for the Nash equilibrium (or equilibria) in each of the following games. (a) The following two-by-two game is a little harder to solve since firm 2’spreferred strategy depends of what firm 1 does. But firm 1 has a dominantstrategy so this game has one Nash equilibrium. Firm 2 Launch Don’tFirm 1 Launch 60, -10 100, 0 Don’t 80, 30 120, 0 What is the Nash equilibrium of this simultaneous-move game? (b) What would the outcome of this game be if instead firm 1 moved first and then, after seeing what firm 1 chose, firm 2 chose it strategy? In this case firm 1 doesn’t necessarily need to choose a best response, but firm 2 must choose a best response since it moves second.
2. Provide the normal-form expression to the extensive-form game below, and find all pure-strategy Nash equilibria there. Find the subgame-perfect Nash equilibrium then. A B X E Y B A B F t G F G BF B D A 0 3. Find the subgame perfect Nash equilibria (may or may not be unique) in the game below. A B 100 30 F 60 9 5 B 3 5 12 10 60 10 80 10 180 60 200 40
5. The Stag Hunt is a famous coordination game where two hunters must work together to hunt a stag but each one has the option to go solo and hunt a hare. The following payoff matrix depicts such a game: a. b. Hunter A Stag Hare Stag 5,5 4,0 Hunter B Hare 0,4 4,4 List any pure strategy Nash equilibria if they exist. Does the game have a mixed strategy Nash equilibrium? If so, solve for it.
learn.canterbury.ac.nz Clasarsom Nov 15-ICO EUC LEARN | AKO See the game below and answer the questions 8 to 11: Player-1 C Player-2 X, Y Y Player-1 9 14 8. Player-2 16 17 16 Nash Equilibrium in this game: Select one: O a. Playert: C; Player2: X O b. Playert: C; Player2: Y Oc. Playert: L; Player2: X Od. Playert: L; Player2: Y e. None