000696357 000__ 03457cam\a2200469Ki\4500 000696357 001__ 696357 000696357 005__ 20230306135552.0 000696357 006__ m\\\\\o\\d\\\\\\\\ 000696357 007__ cr\cnu---unuuu 000696357 008__ 131210s2014\\\\nyua\\\\ob\\\\001\0\eng\d 000696357 020__ $$a9781461490500 $$qelectronic book 000696357 020__ $$a1461490502 $$qelectronic book 000696357 020__ $$z9781461490494 000696357 0247_ $$a10.1007/978-1-4614-9050-0$$2doi 000696357 035__ $$aSP(OCoLC)ocn864876708 000696357 035__ $$aSP(OCoLC)864876708 000696357 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dN$T$$dE7B$$dYDXCP$$dCOO 000696357 049__ $$aISEA 000696357 050_4 $$aQA269 000696357 08204 $$a519.3$$223 000696357 1001_ $$aWashburn, Alan R.,$$eauthor. 000696357 24510 $$aTwo-person zero-sum games$$h[electronic resource] /$$cAlan Washburn. 000696357 250__ $$aFourth edition. 000696357 264_1 $$aNew York :$$bSpringer,$$c2014. 000696357 300__ $$a1 online resource. 000696357 336__ $$atext$$btxt$$2rdacontent 000696357 337__ $$acomputer$$bc$$2rdamedia 000696357 338__ $$aonline resource$$bcr$$2rdacarrier 000696357 4901_ $$aInternational series in operations research & management science ;$$vvolume 201 000696357 504__ $$aIncludes bibliographical references and index. 000696357 5050_ $$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. 000696357 506__ $$aAccess limited to authorized users. 000696357 520__ $$aTwo-person zero-sum game theory deals with situations that are perfectly competitivethere 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. 000696357 588__ $$aDescription based on print version record. 000696357 650_0 $$aGame theory. 000696357 650_0 $$aGames of strategy (Mathematics) 000696357 77608 $$iPrint version:$$aWashburn, Alan R., author.$$sTwo-person zero-sum games.$$tTwo-person zero-sum games.$$bFourth edition$$z9781461490494$$w(OCoLC)861319084 000696357 830_0 $$aInternational series in operations research & management science ;$$vv. 201. 000696357 85280 $$bebk$$hSpringerLink 000696357 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://dx.doi.org/10.1007/978-1-4614-9050-0$$zOnline Access 000696357 909CO $$ooai:library.usi.edu:696357$$pGLOBAL_SET 000696357 980__ $$aEBOOK 000696357 980__ $$aBIB 000696357 982__ $$aEbook 000696357 983__ $$aOnline 000696357 994__ $$a92$$bISE