rock paper scissors rock 0. -3 1 раper 0. -1 scissors -1 (a) Show that xT= ( ) and yT= ( ) together are not a Nash equilibrium for this modified game. 3' 31 (b) Formulate a linear program that can be used to calculate a mixed strategy xE 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.

rock paper scissors rock 0. -3 1 раper 0. -1 scissors -1 (a) Show that xT= ( ) and yT= ( ) together are not a Nash equilibrium for this modified game. 3' 31 (b) Formulate a linear program that can be used to calculate a mixed strategy xE 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.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

し(5,3) b I(2,2) も(0,0) (4,12) a (12.4) (0,0) i). List all subgame pertect Nash equilibria and name one Nash eqvilibrivm that is not subgame pertect i). How many strategies does playot and player 2 have?
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 Suppose two players play one of the two normal-form games shown in Figure 1. L U 0,-1 D 2,4 R 2,0 6,0 L U | 4,-1 D 2,-2 R 2,0Now suppose that Player 2 knows which game is being played, but Player 1 does not. Find the pure strategy Bayesian Nash equilibrium of this game.
Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper scissors rock 0. -3 1 1. раper scissors -1 -1 3 (a) Show that xT= (,) and yT= (5) together are not a Nash equilibrium 3'31 for this modified 3'3 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.
You are playing a game with a friend. It’s yourmove but you don’t have a dominant strategy.Your payoff depends on what your friend doesafter your move. You consider flipping a coin todecide what to do. You are about to reach for acoin, but then you realize that your friend has adominant strategy. Explain how using backwardinduction (rather than a coin toss) will now determine your next move
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…
3. For the friend-foe game, recall that there were 3 Nash equilibria possible, but the equilibria set didn't include the cooperative outcome, for which both players would win. Friend Foe Friend | 500,500 0,1000 Foe 1000,0 0,0 a) If the game is played repeatedly, propose a play strategy that will enforce cooperation. For what values of ô (discount factor) the equilibrium will be (Friend, Friend)?
Costco Spend $1B on advertising Spend $1.5B on advertising Spend $1B on advertising $3.5B; $2.7B $4.2; $2.2B Target Spend $1.5B on advertising $3.2B; $3.4B $4B; $3B
Please look at the payoff matrix below which shows the benefits that would accrue to each player in a 2-player.non-sequential, non-repeated game. a) Identify the collusive (cooperative) equilibrium. b) Identify the secure strategy (maximin) equilibrium c) Identify the maximax equilibrium d) Identify the Nash equilibrium Apple Inc. Strategy 1 Strategy 2 Strategy 3 20 40 60 60 1000 200 Strategy A 70 50 90 Banana Inc. 400 70 300 Strategy B 40 80 100 90 150 80 Strategy C
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
Question 4. Zeynep and Mehmet will eventually play the following game. Mehmet L R U 3,1 0,0 Zeynep D 0,3 1,3 In a preliminary stage, Zeynep has already asked Mehmet to allow her to move first and proposed to pay him 1 unit of her own payoff in exchange. So Mehmet has to options: • If he accepts Zeynep's offer: they will play the sequential move version of the above game in which Zeynep moves first. Mehmet will receive 1 unit of utility more, and Zeynep will receive 1 unit of utility less (in any outcome of the game) compared to the payoffs given in the bimatrix. 2 • If he rejects Zeynep's offer: they will play the simultaneous move game. a. Represent this strategic interaction in a game tree. b. How many information sets does each player have? c. Characterize the set of pure strategies for both players. d. Present this game as a normal-form game, and characterize the set of pure strategy Nash equi- libria.
GAME UUU B1 Player B B2 A1 7,13 5, 10 A2 3,8 9,16 Player A A3 5,8 4,7 In Game UUU (see table above), assuming players move simultaneously, Player A choosing A1 and Player B choosing B3 is a Nash equilibrium. Player A choosing A3 and Player B choosing B2 is a Nash equilibrium. Both Player A choosing A1 and Player B choosing B1 and Player A choosing A2 and player B choosing B2 are Nash equilibria in pure strategies Player A choosing A1 and Player B choosing B2 is a Nash equilibrium.