Question 1
Iterated removal of strictly dominated strategies
Normal | |||
1 \ 2 | L | M | R |
U | 3,8 | 2,0 | 1,2 |
D | 0,0 | 1,7 | 8,2 |
True or false: The previous game is dominance solvable.
[Consider both pure strategies and mixed strategies.]
Your Answer | Score | Explanation | |
---|---|---|---|
1.00 | |||
Total | 1.00 / 1.00 |
Question 2
Iterated removal of weakly dominated strategies
In order to illustrate the problem that arises when iteratively eliminating
weakly dominated strategies, consider the following game:
True or false: in the above game the order of elimination of
weakly dominated strategies does not matter (that is, the final outcome is the same regardless of the order in which weakly dominated strategies are eliminated.). [Hint: start the process of iterative elimination of
weakly dominated strategies by eliminating different strategies at the beginning of the process.]
Normal | |||
1 \ 2 | L | M | R |
U | 4,3 | 3,5 | 3,5 |
D | 3,4 | 5,3 | 3,4 |
Your Answer |
---|