An elementary minimax theorem
A recent simple proof for von Neumann's minimax theorem by \textit{I. Joó} [ibid. 42, 91-94 (1980; Zbl 0436.49016)] urged us to formulate a minimax principle as a direct property of the function in question. In consequence our approach omits the usual convexity requirements. However, our proof is simple by applying a finite dimensional separation result concerning convex sets. In fact we use a modified version of a proof taken from \textit{A. V. Balakrishnan} [Applied functional analysis (1981; Zbl 0459.46014)]. Our theorem generalizes some of the known results of this type.
- A general saddle point theorem and its applications
- A simple proof for König's minimax theorem
- On a generalized sup-inf problem
- The level set method of Joó and its use in minimax theory
- Passy-Prisman's minimax theorem.
- A very complicated proof of the minimax theorem
- Von Neumann, Ville, and the minimax theorem
- A simpler proof of the von Neumann minimax theorem
- A simple proof of the minimax-theorem
- The von Neumann minimax theorem revisited
- scientific article; zbMATH DE number 62401 (Why is no real title available?)
- Sur un principe géométrique en analyse convexe
- Infimum Principle
- scientific article; zbMATH DE number 2041502 (Why is no real title available?)
- An elementary minimax inequality
- Minimax Theorem Revisited
- Minimax results and finite-dimensional separation
This page was built for publication: An elementary minimax theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5185582)