 A closely related process is iterated removal of weakly dominated strategies, where some move a is deleted if there exists a b that outperforms a on some of the opponents’ moves, while being at least as good on the remaining ones. Unlike its strict counterpart, iterated removal of weakly dominated strategies suffers from a number of technical and conceptual intricacies, such as order dependence of iterated deletion (Samuelson 1992; Pacuit &amp; Roy 2011).