 First remove the right-hand column, i.e., E’s action c which is dominated by either of a and b. With c being removed, A’s action f has become strictly dominated. After its removal, E’s action b becomes strictly dominated, and after that, A’s action e. At the end of the process, iterated removal leaves nothing but the state \((d,a)\), the game’s unique Nash equilibrium. In general, the resulting game matrix after all removals is guaranteed to contain all Nash equilibria of the original game, but it may also contain further strategy combinations.