To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Minimax theorem

From Wikipedia, the free encyclopedia

In the mathematical area of game theory, a minimax theorem is a theorem providing conditions that guarantee that the max–min inequality is also an equality. The first theorem in this sense is von Neumann's minimax theorem from 1928, which was considered the starting point of game theory. Since then, several generalizations and alternative versions of von Neumann's original theorem have appeared in the literature.[1][2]

Zero-sum games

The function f(x,y)=x2-y2 is concave-convex.

The minimax theorem was first proven and published in 1928 by John von Neumann,[3] who is quoted as saying "As far as I can see, there could be no theory of games … without that theorem … I thought there was nothing worth publishing until the Minimax Theorem was proved".[4]

Formally, von Neumann's minimax theorem states:

Let ${\displaystyle X\subset \mathbb {R} ^{n}}$ and ${\displaystyle Y\subset \mathbb {R} ^{m}}$ be compact convex sets. If ${\displaystyle f:X\times Y\rightarrow \mathbb {R} }$ is a continuous function that is concave-convex, i.e.

${\displaystyle f(\cdot ,y):X\rightarrow \mathbb {R} }$ is concave for fixed ${\displaystyle y}$, and
${\displaystyle f(x,\cdot ):Y\rightarrow \mathbb {R} }$ is convex for fixed ${\displaystyle x}$.

Then we have that

${\displaystyle \max _{x\in X}\min _{y\in Y}f(x,y)=\min _{y\in Y}\max _{x\in X}f(x,y).}$

Examples

If ${\displaystyle f(x,y)=x^{T}Ay}$ for a finite matrix ${\displaystyle A\in \mathbb {R} ^{n\times m}}$, we have:

${\displaystyle \max _{x\in X}\min _{y\in Y}x^{T}Ay=\min _{y\in Y}\max _{x\in X}x^{T}Ay.}$

References

1. ^ Du, Ding-Zhu; Pardalos, Panos M., eds. (1995). Minimax and Applications. Boston, MA: Springer US. ISBN 9781461335573.
2. ^ Brandt, Felix; Brill, Markus; Suksompong, Warut (2016). "An ordinal minimax theorem". Games and Economic Behavior. 95: 107–112. arXiv:1412.4198. doi:10.1016/j.geb.2015.12.010.
3. ^ Von Neumann, J. (1928). "Zur Theorie der Gesellschaftsspiele". Math. Ann. 100: 295–320. doi:10.1007/BF01448847.
4. ^ John L Casti (1996). Five golden rules: great theories of 20th-century mathematics – and why they matter. New York: Wiley-Interscience. p. 19. ISBN 978-0-471-00261-1.

This page was last edited on 18 March 2021, at 02:53
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.