John von Neumann's conception of the minimax theorem: A journey through different mathematical contexts (Q5952718): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s004070100041 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1974155983 / rank | |||
Normal rank |
Latest revision as of 22:17, 19 March 2024
scientific article; zbMATH DE number 1693161
Language | Label | Description | Also known as |
---|---|---|---|
English | John von Neumann's conception of the minimax theorem: A journey through different mathematical contexts |
scientific article; zbMATH DE number 1693161 |
Statements
John von Neumann's conception of the minimax theorem: A journey through different mathematical contexts (English)
0 references
4 July 2002
0 references
The article is a very carefully elaborated and well argumented historical study of von Neumann's insight into the importance of minimax theorems. In 1928 von Neumann considered two-person zero-sum games; that publication was about linear inequalities. In 1937, the subject was linked to fixed point properties, mainly Brouwer's theorem; solutions appeared as saddle points. During the meantime E. Borel had been the initiator of game theory. Von Neumann's 1944 book, written in collaboration with the economist Morgenstern, covers the whole subject. The question of priority, raised mainly by M. Fréchet, was acknowledged by von Neumann, who had been informed of Borel's work while proofreading his 1937 article. The author primarily stresses the impact of the minimax theorem and sees a philosophical issue raised by the question whether theorems that turn out to be equivalent have the same significance or the same potential for stimulating further developments regardless of their mathematical context. Also it should be noticed that von Neumann's results prepared the later discipline of linear and nonlinear programming.
0 references
minimax properties
0 references
fixed point theorems
0 references