Two-Person Zero-Sum Game with Finite Strategies has Solution

Theorem

Let $G$ be a two-person zero-sum game.

Let each player of $G$ have a finite set of strategies available.

Then $G$ has at least one solution.

Proof

This theorem requires a proof. In particular: Proof given later in book. Chapter III gets technical. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Sources

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