Question

2. Iterative Deletion of (weakly) Dominated Strategies Consider the following two-player game 2 I c I T 1,1 0,1 3,1 1 M 1,0 2

0 0
Add a comment Improve this question Transcribed image text
Answer #1

a)

Player 1)

Taking up the first player, the strategy M has been weakly dominated by strategy D. ( 1,3, 2) = > (1,2,1).

There is no strictly dominated strategy.

Player 2)

Similarly, strategy C has been weakly dominated by strategy r. Thus, strategy C must be deleted.

This is no strictly dominated strategy.

b)

The reduced form of Game:

I R
T 1,1 3,1
D 1,3 2,2

Player 1)

D has been weakly dominated by the T,

For player 2, Similarly R has been weakly dominated by the I. R must be deleted.

c)

In the first round, M was dominated by the D. But in second round D has been dominated by the T,

Similarly. for player 2. C was dominated by the R and in second round R was dominated by the I.

In both cases, less powerful strategy in first round tends to be more powerful in second round.

Equilibrium occurs when ( T,I)

We must exercise the full iterative process to reach a rational conclusion.  

Add a comment
Know the answer?
Add Answer to:
2. Iterative Deletion of (weakly) Dominated Strategies Consider the following two-player game 2 I c I...
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
  • 7. Consider the following two player game, with the players being 1 and 2. As usual...

    7. Consider the following two player game, with the players being 1 and 2. As usual 1 chooses a row and 2 a column. ABC a 1,4 2,1 3,2 4,1 b 2,3 3,4 4,3 1,2 с 3,1 4,2 1,4 2,3 d 4,2 1,3 4,3 3,2 (a) Which strategies satisfy iterated elimination of strictly dominated strategies? How many levels of knowledge of rationality do you have to assume to obtain your result? (b) If you were allowed to follow the same...

  • Iterated Iterated elimination of dominated strategies: Eliminate all strictly (weakly) dominated strategies for all players in...

    Iterated Iterated elimination of dominated strategies: Eliminate all strictly (weakly) dominated strategies for all players in the original game. Eliminate all strictly (weakly) dominated strategies for all players in the modified game where players cannot choose any strategy that was eliminated at Step 1. 3 Eliminate all strictly (weakly) dominated strategies for all players in the modified game where players cannot choose any strategy that was eliminated at Steps 1 and 2. 4 ... and so on until there are...

  • IDSDS= Iterative Deletion of Strictly Dominated Strategies Exercise 3- Unemployment benefits. Consider the following simultaneous-move game...

    IDSDS= Iterative Deletion of Strictly Dominated Strategies Exercise 3- Unemployment benefits. Consider the following simultaneous-move game between the government (row player), which decides whether to offer unemployment benefits, and an unemployed worker (column player), who chooses whether to search for a job. As you interpret from the payoff matrix below, the unemployed worker only finds it optimal to search for a job when he receives no unemployment benefit; while the government only finds it optimal to help the worker when...

  • Problem 2: Consider the following normal form game: | A | B | C D L...

    Problem 2: Consider the following normal form game: | A | B | C D L 2 ,3 -1,3 0,0 4,3 M -1,0 3,0 / 0,10 2,0 R 1,1 | 2,1 3,1 3,1 Part a: What are the pure strategies that are strictly dominated in the above game? Part 6: What are the rationalizable strategies for each player? What are all the rationalizable strategy profiles? Part c: Find all of the Nash equilibria of the game above.

  • Problem #3: Strictly dominated and non-rationalizable strategies (6 pts) Below, there are three game tables. For...

    Problem #3: Strictly dominated and non-rationalizable strategies (6 pts) Below, there are three game tables. For each one, identify which strategies are non-rationalizable (if any), and which strategies are strictly dominated (if any). Do this for both players in each game. Note: You don't need to use IESDS or IENBR in this problem: I only want to know which strategies are strictly dominated or non-rationalizable in the games as presented. Rogers Go Rogue Go Legit 2,3 3,4 3,2 5,1 3,1...

  • Q1 Elimination of strictly-dominated strategies In each of the following two-player games, what strategies survive iterated...

    Q1 Elimination of strictly-dominated strategies In each of the following two-player games, what strategies survive iterated elimination of strictly- dominated strategies? Player 2 Lett Center Right Top 0.2 4, 3 3,1 Player1 Middle 1, 2 2,0 2, Bottom 2,4 36 0,3 Player 2 Left Center Right Top 1, 3 ,4 ,2 Player 1 Middle 2,2 2 3,1 Bottom 3, 5 43 1, 4

  • Some notes: A hundred players are participating in this game (N 100). Each player has to...

    Some notes: A hundred players are participating in this game (N 100). Each player has to choose an integer between 1 and 100 in order to guess "5/6 of the average of the responses given by all players". Each player who guesses the integer closest to the 5/6 of the average of all the responses, wins (a) Q4 Find all weakly dominated strategies (if any). (b) Find all strategies that survive the Iterative Elimination of Dominated Strategies (IEDS) (if any)...

  • DLM R A 2,3 -1,0 1,1 B -1,3 3,0 2,1 C 0,0 0,10 3,1 D 4,3...

    DLM R A 2,3 -1,0 1,1 B -1,3 3,0 2,1 C 0,0 0,10 3,1 D 4,3 2,0 3,1 Part a: What are the pure strategies that are strictly dominated in the above game? Part 6: What are the rationalizable strategies for each player? What are all the rationalizable strategy profiles? Part c: Find all of the Nash equilibria of the game above.

  • i K + A B C D W 2,2 5,0 3,6 4,1 X 1,3 2,2 4,5...

    i K + A B C D W 2,2 5,0 3,6 4,1 X 1,3 2,2 4,5 1,2 Y 3,1 1,1 5,3 6,0 27 DETE 1. (5 points) Find all strictly dominated strategies in this game. 2. (10 points) Find the set of rationalizable strategies for each player. 3. (10 points) Find all the Nash equilibria..

  • 2. (5 marks total IEDS practice Use iterated elimination of dominated strategies to reduce the following...

    2. (5 marks total IEDS practice Use iterated elimination of dominated strategies to reduce the following games. We will call the row player P1 and the column player P2; note that for each entry in the payoff matrices below, PI's payoff is listed first. Clearly indicate: the order in which you eliminate strategies; whether the eliminated strategy is strictly or weakly dominated; If you find a dominant strategy equilibrium, state what it is. Is it unique? 81 (1,5) 50, -11)...

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