Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T21:17:00.541Z Has data issue: false hasContentIssue false

Yet Another Proof of the Minimax Theorem

Published online by Cambridge University Press:  20 November 2018

J.E.L. Peck*
Affiliation:
McGill University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

There are so many proofs of this theorem in the literature, that an excuse is necessary before exhibiting another. Such may be found by examining the proof given below for the following: it uses no matrices, almost no topology and makes little use of the geometry of convex sets; it applies equally well to the case where only one of the pure strategy spaces is finite; also there is no assumption that the payoff function is bounded. Thus it can provide a short route to the more general forms of the theorem.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1958