Definition:Dominating Strategy
Jump to navigation
Jump to search
Definition
Let $G$ be a game.
Let player $P$ have pure strategies $A_1$ and $A_2$ in $G$.
Then $A_1$ dominates $A_2$ if and only if:
- for any strategy of an opposing player, $A_1$ is at least as good as $A_2$
- for at least one strategy of an opposing player, $A_1$ is strictly better than $A_2$.
Also known as
The specific language used for a dominating strategy can vary according to usage:
- $A_1$ is a dominating strategy over $A_2$
- $A_1$ is dominant over $A_2$
- $A_2$ is dominated by $A_1$
and so on.
Also see
- Results about dominating strategies can be found here.
Sources
- 1956: Steven Vajda: The Theory of Games and Linear Programming ... (previous) ... (next): Chapter $\text{I}$: An Outline of the Theory of Games: $3$