Question

3. For the game represented below 1) Modify the game matrix by eliminating dominated strategies 2) Find a Nash Equilibrium in
0 0
Add a comment Improve this question Transcribed image text
Answer #1

U 5,2 3,4 4, 4 2,2 33 3,5 44 04 D 2,3 1,5 30 At First comparing the payoffs for Player 1 under all action A, B, C o. Now For(2) NE in pure stotlegy A 45,2 3,44 C 3,54 44 Best Response of Player 1 to Playa & playing X:BR (X) BR, (X) = {A} broz 573We note that the expected payot haver I depends on the pros of playan 2 I choosing his actions (adig! E, (C) = 39 +401-q) = 4

Add a comment
Know the answer?
Add Answer to:
3. For the game represented below 1) Modify the game matrix by eliminating dominated strategies 2)...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Game Theory Nash Equilibrium Mixed strategies for 2*3 Matrix

    a)                  Eliminate strictly dominated strategies.b)                  If the game does not have a pure strategy Nash equilibrium,find the mixed strategy Nash equilibrium for the smaller game(after eliminating dominated strategies). Player 2Player 1abcA4,33,22,4B1,35,33,3

  • ) Solve the game below by iterated elimination of strongly dominated strategies (Hint: One of the...

    ) Solve the game below by iterated elimination of strongly dominated strategies (Hint: One of the pure strategies for player 1 is strongly dominated by a mixed strategy). At each step of the elimination, state which pure strategy you are eliminating and which strategy (there can be more than one; just state one) it is strongly dominated by. X Y Z A 5,-2 0,1 6,0 B 2,8 2,3 1,4 C 0,0 7,1 -2,0

  • Remove any dominated strategies from the payoff matrix below. Find the optimum strategies for player A...

    Remove any dominated strategies from the payoff matrix below. Find the optimum strategies for player A and player B. Find the value of the game. -1 91 2-5 96 Which matrix is obtained when all dominated strategies are removed? OB. -1 9 2-5 OC. [-19] OD. -1 9 | 2-5 What is the optimum strategy for player A? Choose row 1 with probability . Choose row 2 with probability Choose row 3 with probability (Type integers or simplified fractions.) What...

  • 4. Consider the following game matrix: LCR T 3 ,1 0,0 4,1 M10, 02, 24, 3...

    4. Consider the following game matrix: LCR T 3 ,1 0,0 4,1 M10, 02, 24, 3 B 7,6 | 1,2 3,1 (a) Find all the strictly dominated (pure) strategies for each player. (b) Find all the weakly dominated (pure) strategies of each player. (c) Does the game has a strict dominant strategy equilibrium?

  • (20 points) Exercise 3: (Midterm 2018) Consider the following normal-form game, where the pure strategies for...

    (20 points) Exercise 3: (Midterm 2018) Consider the following normal-form game, where the pure strategies for Player 1 are U, M, and D, and the pure strategies for Player 2 are L, C, and R. The first payoff in each cell of the matrix belongs to Player 1, and the second one belongs to Player 2. Player 2 IL CR u 6,8 2,6 8,2 Player 1 M 8,2 4,4 9,5 8,10 4,6 6,7 (7) a) Find the strictly dominated (pure)...

  • Find the optimum strategies for player A and player B in the game represented by the...

    Find the optimum strategies for player A and player B in the game represented by the following payoff matrix. Find the value of the game. -3 1/5 0 -2

  • Problem 1 Consider the pay-off matrix 1,2 3,1 4,2 2,0 3,5 1,6 1,5 5,4 3,2 (1)...

    Problem 1 Consider the pay-off matrix 1,2 3,1 4,2 2,0 3,5 1,6 1,5 5,4 3,2 (1) Suppose player I guesses that player II will play the mixed strat (2) Find a Nash equilibrium in which player II plays a mixed strat- (3) Is there a Nash equilibrium in which some player has a mixed egy ( , 호, :). What is player l's best response? egy using only the first and third strategies. strategy using all three of his pure...

  • 1. In the game below A chooses rows and B (i) Find all the strategies that...

    1. In the game below A chooses rows and B (i) Find all the strategies that survive iterated deletion of strictly dominated strategies (IDSDS) (ii) Find each player’s best responses and the Nash Equilibrium 2. Consider the game structure below for the next several questions: (i) What must be true about the values of a, b, c, and d in order for U to be a strictly dominated strategy? (ii) What must be true about the values of a, b,...

  • 3. General Extensive Form Game D Suppose the following general extensive form game 1/2 1/2 (2,...

    3. General Extensive Form Game D Suppose the following general extensive form game 1/2 1/2 (2, 2) (2, 2) (0, 6) (6, 0 (0,0 (6, 4) (a) Represent this game in normal form by using a matrix, and find all pure strategy Bayesian Nash equilibrium (equilibria) b) Find pure strategy subgame perfect equilibrium (or equilibria) of this game. c) Find pure strategy perfect Bayesian equilibrium (or equilibria) of this game.

  • Problem 10 Find all pure-strategy Nash Equilibria of the three-player game below. Notice that player 3...

    Problem 10 Find all pure-strategy Nash Equilibria of the three-player game below. Notice that player 3 has four strategies from which to select, represented by the four matrices. Matrix W Matrix X Matrix Y Matrix Z = 5.5" LR LR LR 1,0,3 A B 1,0,3 2,2,2 1,0,3 0,0,1 A B 1,0,3 1,0,3 2,2,2 0,3,3 A B 1,0,2 1,0,2 2,2,2 0,0,1 A B 1,0,2 1,0,2 2,2,2 0,3,3

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT