Best response adaptation under dominance solvability

Two new properties of a finite strategic game, strong and weak BR-dominance solvability, are introduced. The first property holds, e.g., if the game is strongly dominance solvable or if it is weakly dominance solvable and all best responses are unique. It ensures that every simultaneous best response adjustment path, as well as every non-discriminatory individual best response improvement path, reaches a Nash equilibrium in a finite number of steps. The second property holds, e.g., if the game is weakly dominance solvable; it ensures that every strategy profile can be connected to a Nash equilibrium with a simultaneous best response path and with an individual best response path (if there are more than two players, unmotivated switches from one best response to another may be needed). In a two person game, weak BR-dominance solvability is necessary for the acyclicity of simultaneous best response adjustment paths, as well as for the acyclicity of best response improvement paths provided the set of Nash equilibria is rectangular.