 The fact that further strategies may become dominated suggests to repeat the procedure, turning removal of dominated strategies into an iterated process. When games are finite, this process is guaranteed to converge in finite time. Iterated removal of dominated strategies on binary preference relations is a qualitative variant of the version employed in classical game theory, where cardinal utility values are assumed (Leyton-Brown &amp; Shoham 2008).