LEADER 06978nam  22018614a 450 
001 9910818504203321
005 20240529152637.0
010   $a1-282-15911-9
010   $a9786612159114
010   $a1-4008-2956-9
024 7 $a10.1515/9781400829569
035   $a(CKB)1000000000788592
035   $a(EBL)457848
035   $a(OCoLC)436089416
035   $a(SSID)ssj0000190889
035   $a(PQKBManifestationID)11171433
035   $a(PQKBTitleCode)TC0000190889
035   $a(PQKBWorkID)10201404
035   $a(PQKB)10641461
035   $a(DE-B1597)446510
035   $a(OCoLC)979968441
035   $a(DE-B1597)9781400829569
035   $a(Au-PeEL)EBL457848
035   $a(CaPaEBR)ebr10312537
035   $a(CaONFJC)MIL215911
035   $a(PPN)170248178
035   $a(FR-PaCSA)10294917
035   $a(MiAaPQ)EBC457848
035   $a(EXLCZ)991000000000788592
100   $a20020402d2003      uy         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aLectures on the theory of games /$fHarold W. Kuhn
205   $aCourse Book
210  1$aPrinceton, New Jersey :$cPrinceton University Press,$d2003.
215   $a1 online resource (118 pages)
225 1 $aAnnals of mathematics studies ;$vno. 37.
300   $aDescription based upon print version of record.
311   $a0-691-02771-4 
311   $a0-691-02772-2 
320   $aIncludes bibliographical references and index.
327   $tFrontmatter --$tContents --$tAuthor's Note --$tPreface --$tChapter 1. What Is the Theory of Games? --$tChapter 2. Matrix Games --$tChapter 3. Extensive Games --$tChapter 4. Infinite Games --$tIndex
330   $aThis book is a spectacular introduction to the modern mathematical discipline known as the Theory of Games. Harold Kuhn first presented these lectures at Princeton University in 1952. They succinctly convey the essence of the theory, in part through the prism of the most exciting developments at its frontiers half a century ago. Kuhn devotes considerable space to topics that, while not strictly the subject matter of game theory, are firmly bound to it. These are taken mainly from the geometry of convex sets and the theory of probability distributions. The book opens by addressing "matrix games," a name first introduced in these lectures as an abbreviation for two-person, zero-sum games in normal form with a finite number of pure strategies. It continues with a treatment of games in extensive form, using a model introduced by the author in 1950 that quickly supplanted von Neumann and Morgenstern's cumbersome approach. A final section deals with games that have an infinite number of pure strategies for the two players. Throughout, the theory is generously illustrated with examples, and exercises test the reader's understanding. A historical note caps off each chapter. For readers familiar with the calculus and with elementary matrix theory or vector analysis, this book offers an indispensable store of vital insights on a subject whose importance has only grown with the years.
410  0$aAnnals of mathematics studies ;$vno. 37.
606   $aGame theory
610   $aAbstract algebra.
610   $aAddition.
610   $aAlgorithm.
610   $aAlmost surely.
610   $aAnalytic geometry.
610   $aAxiom.
610   $aBasic solution (linear programming).
610   $aBig O notation.
610   $aBijection.
610   $aBinary relation.
610   $aBoundary (topology).
610   $aBounded set (topological vector space).
610   $aBranch point.
610   $aCalculation.
610   $aCardinality of the continuum.
610   $aCardinality.
610   $aCartesian coordinate system.
610   $aCharacteristic function (probability theory).
610   $aCombination.
610   $aComputation.
610   $aConnectivity (graph theory).
610   $aConstructive proof.
610   $aConvex combination.
610   $aConvex function.
610   $aConvex hull.
610   $aConvex set.
610   $aCoordinate system.
610   $aDavid Gale.
610   $aDiagram (category theory).
610   $aDifferential equation.
610   $aDimension (vector space).
610   $aDimensional analysis.
610   $aDisjoint sets.
610   $aDistribution function.
610   $aEmbedding.
610   $aEmpty set.
610   $aEnumeration.
610   $aEquation.
610   $aEquilibrium point.
610   $aEquivalence relation.
610   $aEstimation.
610   $aEuclidean space.
610   $aExistential quantification.
610   $aExpected loss.
610   $aExtreme point.
610   $aFormal scheme.
610   $aFundamental theorem.
610   $aGalois theory.
610   $aGeometry.
610   $aHyperplane.
610   $aInequality (mathematics).
610   $aInfimum and supremum.
610   $aInteger.
610   $aIterative method.
610   $aLine segment.
610   $aLinear equation.
610   $aLinear inequality.
610   $aMatching Pennies.
610   $aMathematical induction.
610   $aMathematical optimization.
610   $aMathematical theory.
610   $aMathematician.
610   $aMathematics.
610   $aMatrix (mathematics).
610   $aMeasure (mathematics).
610   $aMin-max theorem.
610   $aMinimum distance.
610   $aMutual exclusivity.
610   $aPrediction.
610   $aProbability distribution.
610   $aProbability interpretations.
610   $aProbability measure.
610   $aProbability theory.
610   $aProbability.
610   $aProof by contradiction.
610   $aQuantity.
610   $aRank (linear algebra).
610   $aRational number.
610   $aReal number.
610   $aRequirement.
610   $aScientific notation.
610   $aSign (mathematics).
610   $aSolution set.
610   $aSpecial case.
610   $aStatistics.
610   $aStrategist.
610   $aStrategy (game theory).
610   $aSubset.
610   $aTheorem.
610   $aTheory of Games and Economic Behavior.
610   $aTheory.
610   $aThree-dimensional space (mathematics).
610   $aTotal order.
610   $aTwo-dimensional space.
610   $aUnion (set theory).
610   $aUnit interval.
610   $aUnit square.
610   $aVector Analysis.
610   $aVector calculus.
610   $aVector space.
615  0$aGame theory.
676   $a519.3
700   $aKuhn$b Harold W$g(Harold William),$f1925-2014.$012823
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910818504203321
996   $aLectures on the theory of games$9145191
997   $aUNINA