000 | 03517nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-1-4614-9050-0 | ||
003 | DE-He213 | ||
005 | 20200420211749.0 | ||
007 | cr nn 008mamaa | ||
008 | 131128s2014 xxu| s |||| 0|eng d | ||
020 |
_a9781461490500 _9978-1-4614-9050-0 |
||
024 | 7 |
_a10.1007/978-1-4614-9050-0 _2doi |
|
050 | 4 | _aHD30.23 | |
072 | 7 |
_aKJT _2bicssc |
|
072 | 7 |
_aKJMD _2bicssc |
|
072 | 7 |
_aBUS049000 _2bisacsh |
|
082 | 0 | 4 |
_a658.40301 _223 |
100 | 1 |
_aWashburn, Alan. _eauthor. |
|
245 | 1 | 0 |
_aTwo-Person Zero-Sum Games _h[electronic resource] / _cby Alan Washburn. |
250 | _a4th ed. 2014. | ||
264 | 1 |
_aBoston, MA : _bSpringer US : _bImprint: Springer, _c2014. |
|
300 |
_aXV, 199 p. 62 illus., 12 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aInternational Series in Operations Research & Management Science, _x0884-8289 ; _v201 |
|
505 | 0 | _aSingle Person Background -- Maxmin Versus Minmax -- Matrix Games -- Markov (Multistage) Games -- Games with a Continuum of Strategies -- Blotto Games -- Network Interdiction -- Search Games -- Miscellaneous Games. | |
520 | _aTwo-person zero-sum game theory deals with situations that are perfectly competitive-there are exactly two decision makers for whom there is no possibility of cooperation or compromise. It is the most fundamental part of game theory, and the part most commonly applied. There are diverse applications to military battles, sports, parlor games, economics and politics. The theory was born in World War II, and has by now matured into a significant and tractable body of knowledge about competitive decision making. The advent of modern, powerful computers has enabled the solution of many games that were once beyond computational reach. Two-Person Zero-Sum Games, 4th Ed. offers an up-to-date introduction to the subject, especially its computational aspects. Any finite game can be solved by the brute force method of enumerating all possible strategies and then applying linear programming. The trouble is that many interesting games have far too many strategies to enumerate, even with the aid of computers. After introducing ideas, terminology, and the brute force method in the initial chapters, the rest of the book is devoted to classes of games that can be solved without enumerating every strategy. Numerous examples are given, as well as an extensive set of exercises. Many of the exercises are keyed to sheets of an included Excel workbook that can be freely downloaded from the SpringerExtras website. This new edition can be used as either a reference book or as a textbook. | ||
650 | 0 | _aBusiness. | |
650 | 0 | _aOperations research. | |
650 | 0 | _aDecision making. | |
650 | 0 | _aManagement science. | |
650 | 0 | _aProbabilities. | |
650 | 1 | 4 | _aBusiness and Management. |
650 | 2 | 4 | _aOperation Research/Decision Theory. |
650 | 2 | 4 | _aProbability Theory and Stochastic Processes. |
650 | 2 | 4 | _aOperations Research, Management Science. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9781461490494 |
830 | 0 |
_aInternational Series in Operations Research & Management Science, _x0884-8289 ; _v201 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-1-4614-9050-0 |
912 | _aZDB-2-SBE | ||
942 | _cEBK | ||
999 |
_c51142 _d51142 |