Iterated Elimination of Strictly Dominated Strategies

This lesson shows how to use strict dominance to simplify games.

Takeaway Points

  1. We may remove strictly dominated strategies from a game matrix entirely.
  2. A reduced matrix will still give us all the necessary information we need to solve a game.
  3. We may continue eliminating strictly dominated strategies from the reduced form, even if they were not strictly dominated in the original matrix. (Note this follows directly from the second point.) We call this process iterated elimination of strictly dominated strategies.

Back to Game Theory 101

gt101cover