min-maxadj.n.

Brit.

/ˈmɪnˌmaks/, U.S.

/ˈmɪnˌmæks/

Origin: Formed within English, by compounding; modelled on a German lexical item. Etymons: minimum n., maximum n.

Etymology: < min- (in minimum n.) + max- (in maximum n.), in specific use after German Min Max (J. von Neumann 1928, in Mathematische Annalen 100 307: compare quot. 1944 at sense A.). Compare minimax n. and adj.

Mathematics.

A. adj. (attributive).

Relating to, concerned with, or depending on maximum and minimum values; spec. = minimax adj. 3.

ΚΠ

1944 J. Von Neumann & O. Morgenstern Theory of Games xvii. 154 A slightly more general form of this Min-Max problem arises in another question of mathematical economics.

1961 Jrnl. Royal Statist. Soc. B. 23 359 There are no optimal (as distinct from max-min and min-max) strategies for the two players.

1990 E. Horowitz & S. Sahni Fund. Data Structures in Pascal (ed. 3) x. 528 A min-max heap is a complete binary tree such that if it is not empty, each element has a field called a key.

B. n.

The smallest of a set of maxima; a minimax strategy or value; = minimax n. 2.

ΚΠ

1950 Amer. Math. Monthly 57 511 The main theorem for such games is that there always exist optimal strategies for the two players, a strategy for the one player that maximizes his minimum expectation, and a strategy for the second player that minimizes his maximum risk, the max-min equaling the min-max.

1952 J. C. C. McKinsey Introd. Theory Games i. 19 Find the max min and min max of the two-finger Morra.

2000 Jrnl. Econ. Dynamics & Control (Nexis) 24 1591 This is a min-max strategy which is essentially equivalent to a robust pooling of the scenarios. Robustness is ensured by the noninferiority of min-max.

This is a new entry (OED Third Edition, March 2002; most recently modified version published online March 2022).

单词	min-max
释义	min-maxadj.n. Brit. /ˈmɪnˌmaks/, U.S. /ˈmɪnˌmæks/ Origin: Formed within English, by compounding; modelled on a German lexical item. Etymons: minimum n., maximum n. Etymology: < min- (in minimum n.) + max- (in maximum n.), in specific use after German Min Max (J. von Neumann 1928, in Mathematische Annalen 100 307: compare quot. 1944 at sense A.). Compare minimax n. and adj. Mathematics. A. adj. (attributive). Relating to, concerned with, or depending on maximum and minimum values; spec. = minimax adj. 3. ΚΠ 1944 J. Von Neumann & O. Morgenstern Theory of Games xvii. 154 A slightly more general form of this Min-Max problem arises in another question of mathematical economics. 1961 Jrnl. Royal Statist. Soc. B. 23 359 There are no optimal (as distinct from max-min and min-max) strategies for the two players. 1990 E. Horowitz & S. Sahni Fund. Data Structures in Pascal (ed. 3) x. 528 A min-max heap is a complete binary tree such that if it is not empty, each element has a field called a key. B. n. The smallest of a set of maxima; a minimax strategy or value; = minimax n. 2. ΚΠ 1950 Amer. Math. Monthly 57 511 The main theorem for such games is that there always exist optimal strategies for the two players, a strategy for the one player that maximizes his minimum expectation, and a strategy for the second player that minimizes his maximum risk, the max-min equaling the min-max. 1952 J. C. C. McKinsey Introd. Theory Games i. 19 Find the max min and min max of the two-finger Morra. 2000 Jrnl. Econ. Dynamics & Control (Nexis) 24 1591 This is a min-max strategy which is essentially equivalent to a robust pooling of the scenarios. Robustness is ensured by the noninferiority of min-max. This is a new entry (OED Third Edition, March 2002; most recently modified version published online March 2022). < adj.n.1944
随便看	kneeboot kneeboss kneebowed kneebrace kneebraced kneebracing kneebreech kneebreeched kneebreeches kneebrush kneebuckle kneecap kneecapped kneecapping kneecappings kneecaps kneechest position kneecords kneecrooking kneecrop kneed kneed grass kneedeep kneedrill kneeelbow position