Abstract | Keywords | Export | Availability | Bookmark

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This 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.

Operational research. Game theory --- Game theory --- 519.83 --- Theory of games --- 519.83 Theory of games --- Game theory. --- Games, Theory of --- Mathematical models --- Mathematics --- Abstract algebra. --- Addition. --- Algorithm. --- Almost surely. --- Analytic geometry. --- Axiom. --- Basic solution (linear programming). --- Big O notation. --- Bijection. --- Binary relation. --- Boundary (topology). --- Bounded set (topological vector space). --- Branch point. --- Calculation. --- Cardinality of the continuum. --- Cardinality. --- Cartesian coordinate system. --- Characteristic function (probability theory). --- Combination. --- Computation. --- Connectivity (graph theory). --- Constructive proof. --- Convex combination. --- Convex function. --- Convex hull. --- Convex set. --- Coordinate system. --- David Gale. --- Diagram (category theory). --- Differential equation. --- Dimension (vector space). --- Dimensional analysis. --- Disjoint sets. --- Distribution function. --- Embedding. --- Empty set. --- Enumeration. --- Equation. --- Equilibrium point. --- Equivalence relation. --- Estimation. --- Euclidean space. --- Existential quantification. --- Expected loss. --- Extreme point. --- Formal scheme. --- Fundamental theorem. --- Galois theory. --- Geometry. --- Hyperplane. --- Inequality (mathematics). --- Infimum and supremum. --- Integer. --- Iterative method. --- Line segment. --- Linear equation. --- Linear inequality. --- Matching Pennies. --- Mathematical induction. --- Mathematical optimization. --- Mathematical theory. --- Mathematician. --- Mathematics. --- Matrix (mathematics). --- Measure (mathematics). --- Min-max theorem. --- Minimum distance. --- Mutual exclusivity. --- Prediction. --- Probability distribution. --- Probability interpretations. --- Probability measure. --- Probability theory. --- Probability. --- Proof by contradiction. --- Quantity. --- Rank (linear algebra). --- Rational number. --- Real number. --- Requirement. --- Scientific notation. --- Sign (mathematics). --- Solution set. --- Special case. --- Statistics. --- Strategist. --- Strategy (game theory). --- Subset. --- Theorem. --- Theory of Games and Economic Behavior. --- Theory. --- Three-dimensional space (mathematics). --- Total order. --- Two-dimensional space. --- Union (set theory). --- Unit interval. --- Unit square. --- Vector Analysis. --- Vector calculus. --- Vector space.