Common
Minimax theorem
Gives conditions that guarantee the max–min inequality holds with equality
Minimax 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}...
Open boosters, collect cards and trade them. Free to play.
Play for free