Definition:Completely Mixed Game

Definition

Let $G$ be a game.

Then $G$ is completely mixed if and only if all players use all their strategies in its optimal solution.

Sources

• 1956: Steven Vajda: The Theory of Games and Linear Programming ... (previous) ... (next): Chapter $\text{I}$: An Outline of the Theory of Games: $3$