Question: Let G be a nite N-player game in normal form. Let H be a reduced game that results from iterated elimination of strictly dominated strategies

Let G be a nite N-player game in normal form. Let H be a reduced game that results from iterated elimination of strictly dominated strategies (the elimination process is carried out as far as possible to arrive at H).

Prove that the resulting reduced game H does not depend on the order in which strategies are eliminated.

Hint: Assume that at some point in this process of elimination there are two strategies that can both be eliminated. Eliminate one of these. Can you guarantee that the remaining strategy can still be eliminated?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!