 Shopping Bag ( 0 items )

All (12) from $8.46

New (8) from $32.99

Used (4) from $8.46
More About This Textbook
Overview
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 twoperson, zerosum 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.
Product Details
Related Subjects
Read an Excerpt
Lectures on the Theory of Games
By Harold W. Kuhn
Princeton
Copyright © 2003All right reserved.
ISBN: 0691027722
Chapter One
What Is the Theory of Games?
The most casual observer of the social behavior of mathematicians will remark that the solitary mathematician is a puzzlesolver while mathematicians together consume an extraordinary amount of time playing games. Coupling this observation with the obvious economic interest of many games of skill and chance, it does not seem strange that the basis for a mathematical theory of games of strategy was created by the mathematician John von Neumann [1]^{*} and elaborated with the economist Oskar Morgenstern [2]. In this series of lectures we shall attempt to present the salient results of this theory.
Although our primary concern will be with the mathematical aspects, a complete understanding of the theory can only come from the recognition that it is an interpreted system. This means that, like any satisfactory physical theory, it consists of (1) an axiom system and (2) a set of semantical rules for its interpretation, that is, a set of prescriptions that connect the mathematical symbols of the axioms with the objects of our experience. In the immediate interpretation, these objects are ordinary parlor games such as chess, poker, or bridge, and the success of the axiom system that we choose is measured by the number of interesting facts that we can derive about these games. There are, of course, other interpretations of the axioms, and one of the more ambitious hopes of the theory is that eventually these will include a substantial portion of the science of economics [3]. In these lectures we will restrict ourselves, with few exceptions, to the principal interpretation in terms of games.
Ideally, such an interpreted system could be presented by giving its axioms and the rules for their interpretation and then deriving all the important theorems of the theory by the application of mathematical techniques. But practically the situation is such that most fields of science seem at the present time to be not yet developed to a degree which would suggest this strict form of presentation; only certain branches of physics and geometry qualify by their apparent completeness. Fortunately for the researcher, the theory of games is by no means complete. Indeed, in some portions, such as games played by more than two players, it seems likely that the final formulation will be far removed from the present theory. Accordingly, the ideal order of presentation will be reversed in these lectures, and it will only be after a number of specific games have been examined in detail that the axioms of the theory will appear.
The central problem of game theory was posed by von Neumann as early as 1926 in Göttingen. It is the following:
Stated in this form, of course, the question is very vague and our first problem will be to sharpen the statement until we can agree upon a meaning. First of all, we mean by a game any of the ordinary objects designated by this name, for instance, chess, checkers, tictactoe, gin rummy. However, unfortunately, the word "game" is used with two meanings in everyday English. We speak of "the game of checkers," referring to the game defined by its rules, and we say that we played "five games of checkers," meaning that we completed five particular contests of checkers. We shall separate these meanings, reserving game for the first meaning only and using the word play for an individual contest. The usage in French is more fortuitous than in English; un jeu is used in the sense that we have just defined for "game" while une partie is a play. A similar distinction must be made between the occasion of a selection of one of several alternatives, which we shall call a move, and the particular selection, which we will call a choice. Thus, when the record of a chess game begins:
the moves are 1, 2 , and 3 while the choices are P K4, P K4, and KtKB3.
In order to give meaning to the phrase, "the most favorable result," we shall assume that, at the end of each play of T, each of the players, P_{i}, will receive an amount of money, h_{i}, called the payoff to player P_{i}, and that the only object of a player will be to maximize the amount of money he receives [4]. In most parlor games, the payoffs satisfy the condition
This important category of games will be called the zerosum games.
Thus we find that, by merely introducing this terminology, we can classify games according to the number of players who participate, the number of moves in the game, and whether the game is zerosum or not. There is one other immediate property that can be used for classification. All parlor games have the characteristic property that, at each move, only a finite number of alternatives are presented to a player. Also, the "length" of a play or the number of possible choices occurring in a play is bounded by a "stop rule." This rule is simple in some cases (in tictactoe, the maximum number of choices is nine, the number of blank squares in the game diagram), while in other games it is quite complicated (in chess, the length of a play is made finite by rules preventing repeated cycles of choices). Such games will be called finite games. However, there certainly exist activities that seem to be games in which people are presented with an infinite number of alternatives, and one can also conceive of games in which a play would consist of an infinite sequence of choices. An example of the first type is provided by a duel in which the duelist has the alternatives of firing at any instant in a fixed interval of the infinite time continuum, while it is a simple matter to construct conceptual games of the second type. Such games will be called infinite games.
The preceding classification suggests that we should attack the central problem posed above for the simplest type of game in this hierarchy. Leaving the case of one player aside for the moment, this simplest game must have two players, two moves, each with a finite number of alternatives, and be zerosum. It is this class of games that we shall analyze in the next chapter.
Table of Contents
Author's Note vii
Preface ix
Chapter 1. What Is the Theory of Games? 1
Notes 3
Chapter 2. Matrix Games 5
2.1 Two Examples 5
2.2 The Definition of a Matrix Game 9
2.3 The Fundamental Theorem for 2 x 2 Matrix Games 10
2.4 The Geometry of Convex Sets 12
2.5 Fundamental Theorem for All Matrix Games 21
2.6 A Graphical Method of Solution 24
2.7 An Algorithm for Solving All Matrix Games 28
2.8 Simplified Poker 36
Notes 45
Appendix 48
Chapter 3. Extensive Games 59
3.1 Some Preliminary Restrictions 59
3.2 The Axiom System 59
3.3 Pure and Mixed Strategies 64
3.4 Games with Perfect Information 66
3.5 A Reduction of the Game Matrix 67
3.6 An Instructive Example 70
3.7 Behavior Strategies and Perfect Recall 72
3.8 Simplified Poker Reconsidered 77
Notes 78
Chapter 4. Infinite Games 81
4.1 Some Preliminary Restrictions 81
4.2 An Illuminating Example 81
4.3 Mixed Strategies and Expectation 83
4.4 The Battle of the Maxmin versus Supinf 88
4.5 The Fundamental Theorem 92
4.6 The Solution of Games on the Unit Square 94
Notes 103
Index 105