A01=Harold W. Kuhn
Abstract algebra
Algorithm
Analytic geometry
Author_Harold W. Kuhn
Axiom
Basic solution (linear programming)
Boundary (topology)
Bounded set (topological vector space)
Calculation
Category=PBUD
Characteristic function (probability theory)
Combination
Computation
Connectivity (graph theory)
Constructive proof
Convex combination
Convex hull
Convex set
Diagram (category theory)
Differential equation
Dimension (vector space)
Dimensional analysis
Disjoint sets
Distribution function
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Equation
Estimation
Euclidean space
Existential quantification
Extreme point
Fundamental theorem
Galois theory
Geometry
Hyperplane
Inequality (mathematics)
Infimum and supremum
Iterative method
Line segment
Linear inequality
Matching Pennies
Mathematical optimization
Mathematical theory
Mathematician
Mathematics
Matrix (mathematics)
Measure (mathematics)
Min-max theorem
Mutual exclusivity
Probability
Probability distribution
Probability interpretations
Probability measure
Probability theory
Proof by contradiction
Quantity
Rank (linear algebra)
Rational number
Real number
Scientific notation
Sign (mathematics)
Solution set
Special case
Strategy (game theory)
Subset
Theorem
Theory
Theory of Games and Economic Behavior
Three-dimensional space (mathematics)
Union (set theory)
Unit interval
Vector Analysis
Vector calculus
Vector space
Product details
- ISBN 9780691027722
- Weight: 170g
- Dimensions: 152 x 235mm
- Publication Date: 26 Jan 2003
- Publisher: Princeton University Press
- Publication City/Country: US
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
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.
Harold W. Kuhn is Professor Emeritus of Mathematics at Princeton University. Joint winner of the 1980 von Neumann Prize in Theory, he is internationally known for co-authoring a paper that initiated the theory of "nonlinear programming." Kuhn is the editor or coeditor of several books (all Princeton), including "The Essential John Nash", "Classics in Game Theory, Linear Inequalities and Related Systems", and "Contributions to the Theory of Games, I and II".
