✳flâneur — a map of the web's best reading

Minimax theorem

en.wikipedia.org · 1,440 words · saved by 1 readers

In the mathematical area of game theory and of convex optimization, a minimax theorem is a theorem that claims that

Minimax theorem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Gives conditions that guarantee the max–min inequality holds with equality Not to be confused with Min-max theorem . In the mathematical area of game theory and of convex optimization , a minimax theorem is a theorem that claims that max x ∈ X min y ∈ Y f ( x , y ) = min y ∈ Y max x ∈ X f ( x , y ) {\displaystyle \max _{x\in X}\min _{y\in Y}f(x,y)=\min _{y\in Y}\max _{x\in X}f(x,y)} under certain conditions on the sets X {\displaystyle X} and Y {\displaystyle Y} and on the function f {\displaystyle f} . [ 1 ] It

Explore this link on the map →

related reading