Von Neumann's minimax theorem through Fourier-Motzkin elimination
Mark Voorneveld

TL;DR
This paper presents a simple and self-contained proof of von Neumann's minimax theorem using Fourier-Motzkin elimination, a method for solving linear inequalities.
Contribution
It introduces an elementary proof of the minimax theorem based on Fourier-Motzkin elimination, simplifying previous approaches.
Findings
Provides a concise proof of the minimax theorem
Demonstrates the applicability of Fourier-Motzkin elimination in game theory
Simplifies understanding of the minimax theorem
Abstract
Fourier-Motzkin elimination, a standard method for solving systems of linear inequalities, leads to an elementary, short, and self-contained proof of von Neumann's minimax theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Inequalities and Applications · Sparse and Compressive Sensing Techniques · Mathematical Analysis and Transform Methods
