 Iterative reasoning strategies akin to Backward Induction also exist for games in strategic form. Rather than defining a new unary move-predicate \(\best\), however, these procedures work by eliminating suboptimal actions. An action a is labeled suboptimal or dominated if there is some other available action, b, that guarantees a better result than a, no matter what the opponents do. In this case a rational player should drop a from her space of admissible acts, as she would never play it.