1) Given the following payoff/loss table for a game between two players: Player 2 (Defensive) Strategies с A 2 5 1 a) What type of game do the two players play? Determine the range of the value of the game. Dat 1 Player 1 (Offensive) 2 Strategies 3 1. LL:12. B 6 4 -2 -1 6 -2

1) Given the following payoff/loss table for a game between two players: Player 2 (Defensive) Strategies с A 2 5 1 a) What type of game do the two players play? Determine the range of the value of the game. Dat 1 Player 1 (Offensive) 2 Strategies 3 1. LL:12. B 6 4 -2 -1 6 -2

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

3. Find the saddle point, if it exists, for the following game. (b) Solve the following game by using the principle of dominance and find the probabilities of strategies for each player and the value of the game. Player B Player A II III IV V 3 4 4 II 2 4 III 4 4 IV 4 4 20 2420 8760
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…
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.
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.
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?
12. Consider a game where each player picks a number from 0 to 60. The guess that is closest to half ofthe average of the chosen numbers wins a prize. If several peopleare equally close, then they share theprize. The game theory implies that (A) all players have dominant strategies to choose 0 (B) all players have dominant strategies to choose 30 (C) there is a Nash equilibrium where all players pick 0 (D) there is a Nash equilibrium where all players pick positive numbers 13. Behavioral data in such games suggests that (A) most subjects choose 0; (B) most subjects choose 30; (C) common answers include 30, 15, 7.5, and 0; (D) most subjects use randomization. Can you help me answer number 13 please?
5) Mixed strategy Nash equilibrium Consider a mixed strategy Nash equilibrium of the following coordination game: Player 2 Player 1 A B a 5.5 6.-2 b -2,6 1,1 a) In the above game, explain in words what condition player 1's probability p of playing strategy A must satisfy to induce player 2 to mix strategies between a and b in equilibrium. b) Solve for the mixed strategy Nash equilibrium where player 1 chooses A with probability P and player 2 chooses a with probability p, for 0 < p, P < 1.
1. Consider the following games, how many strategies (complete plan of action) are available to each player? List all possible strategies for each player. 2. For games described in question 1, find the rollback equilibrium outcome and optimal strategy for each player. (a) ALBUS (b) ALBUS N MINERVA S N MINERVA S E MINERVA MINERVA MINERVA a b b a b a a b J 3,0 b 2,1 1,1 5,0 4,4 1,5 3,3 ALBUS 0,4 2,2 3,1 N 5,2 1,3
3 Use the following payoff matrix for a one-shot game to answer the accompanying questions. 20 oints eBook Player 1 Strategy A B Player 2 X Y 12, 12 -30, 6 6, -30 30, 30 a. Determine the Nash equilibrium outcomes that arise if the players make decisions independently, simultaneously, and without any communication. Instructions: In order to receive full credit, you must make a selection for each option. For correct answer(s), click the box once to place a check mark. For incorrect answer(s), click twice to empty the box. ? (-30, 6) (12.12) ? (6.-30) ? (30, 30) Which of these outcomes would you consider most likely? O (30,30) O(-30, 6) O (12, 12) O(6,-30) b. Suppose player 1 is permitted to "communicate" by uttering one syllable before the players simultaneously and independently make their decisions. What should player 1 utter? OA OB What outcome do you think would occur as a result? O (12, 12) O (-30, 6) O (30, 30) 0 (6,-30) c. Suppose player 2 can choose its strategy before player 1,…
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
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)?
Game theory Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Player 2 7. Player 1 ہے A B C D -3, -3 0, -11 -4, 3 -11, E 0 -7, -7 -12, 0 (a) Identify any dominated strategies in this game. If there are none, state this clearly. (b) Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly.