Decision rule used for minimizing the possible loss for a worst case scenario
This article is about the decision theory concept. For other uses, see Minimax (disambiguation).
Minmax (sometimes Minimax, MM[1] or saddle point[2]) is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. When dealing with gains, it is referred to as "maximin" – to maximize the minimum gain. Originally formulated for several-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty.
^Bacchus, Barua (January 2013). Provincial Healthcare Index 2013 (PDF) (Report). Fraser Institute. p. 25.
^Professor Raymond Flood. Turing and von Neumann (video). Gresham College – via YouTube.
Minmax (sometimes Minimax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy...
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...
estimator (estimation rule) δ M {\displaystyle \delta ^{M}\,\!} is called minimax if its maximal risk is minimal among all estimators of θ {\displaystyle...
Minimax Limited was a British manufacturer of fire extinguishers founded in England in 1903. Their unique conical fire extinguisher was known as 'The...
the Courant minimax principle gives the eigenvalues of a real symmetric matrix. It is named after Richard Courant. The Courant minimax principle gives...
A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that...
and the computation of maximum flows. A closely related problem, the minimax path problem or bottleneck shortest path problem asks for the path that...
systems, the Minimax Condorcet method is a single-winner ranked-choice voting method that always elects the majority (Condorcet) winner. Minimax compares...
Little Machine Constructed by Minimax Dadamax in Person (Von minimax dadamax selbst konstruiertes maschinchen) (1919–20) is a mixed-media work of art by...
varying methodologies for eliminating candidates and transferring votes. The Minimax voting system determines the winner by constructing a comparison table...
node search (BNS), originally known as fuzzified game tree search, is a minimax search algorithm, developed in 2011. The idea is that the knowledge that...
Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game. This algorithm relies on the fact that min...
requires the use of randomised rules to satisfy optimality conditions such as minimax, most notably when deriving confidence intervals and hypothesis tests about...
In geometry, minimax eversions are a class of sphere eversions, constructed by using half-way models. It is a variational method, and consists of special...
embraced the low-fat, "minimax" approach. Minimax also led to three successful cookbooks: Graham Kerr's Smart Cooking, Graham Kerr's Minimax Cookbook, and Graham...
equilibrium theory, particularly for applications of Sion's minimax theorem. Generalizing a minimax theorem of John von Neumann, Sion's theorem is also used...
In mathematics, a saddle point or minimax point is a point on the surface of the graph of a function where the slopes (derivatives) in orthogonal directions...
Challenge Belgium Minimax 2007". DriverDB.com. Archived from the original on 24 August 2014. Retrieved 27 January 2014. "Dutch Championship Minimax 2007". DriverDB...
parties fully randomized strategies there exists a minimax solution or Nash equilibrium. Minimax solution (Nash equilibrium): car is first hidden uniformly...
Global Information