The Theory of Max-Min and its Application to Weapons Allocation Problems (Paperback, Softcover reprint of the original 1st ed. 1967)

Max-Min problems are two-step allocation problems in which one side must make his move knowing that the other side will then learn what the move is and optimally counter. They are fundamental in parti cular to military weapons-selection problems involving large systems such as Minuteman or Polaris, where the systems in the mix are so large that they cannot be concealed from an opponent. One must then expect the opponent to determine on an optlmal mixture of, in the case men tioned above, anti-Minuteman and anti-submarine effort. The author's first introduction to a problem of Max-Min type occurred at The RAND Corporation about 1951. One side allocates anti-missile defenses to various cities. The other side observes this allocation and then allocates missiles to those cities. If F(x, y) denotes the total residual value of the cities after the attack, with x denoting the defender's strategy and y the attacker's, the problem is then to find Max MinF(x, y) = Max MinF(x, y)] ."

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	OEkonometrie und Unternehmensforschung Econometrics and Operations Research, 5
Release date:	March 2012
First published:	1967
Authors:	J.M. Danskin
Dimensions:	235 x 155 x 6mm (L x W x T)
Format:	Paperback
Pages:	128
Edition:	Softcover reprint of the original 1st ed. 1967
ISBN-13:	978-3-642-46094-4
Categories:	Books > Business & Economics > Economics > Econometrics > General Books > Science & Mathematics > Mathematics > Optimization > Game theory Promotions
LSN:	3-642-46094-1
Barcode:	9783642460944

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!