Lectures on the Theory of Games (AM-37) :Lectures on the Theory of Games (AM-37) ( Annals of Mathematics Studies )

Publication subTitle :Lectures on the Theory of Games (AM-37)

Publication series :Annals of Mathematics Studies

Author: Kuhn Harold William;;;  

Publisher: Princeton University Press‎

Publication year: 2009

E-ISBN: 9781400829569

P-ISBN(Paperback): 9780691027715

Subject: O225 Game (Game)

Keyword: 数理科学和化学,经济学

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

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.

Chapter

2.2 The Definition of a Matrix Game

2.3 The Fundamental Theorem for 2 × 2 Matrix Games

2.4 The Geometry of Convex Sets

2.5 Fundamental Theorem for All Matrix Games

2.6 A Graphical Method of Solution

2.7 An Algorithm for Solving All Matrix Games

2.8 Simplified Poker

Notes

Appendix

Chapter 3. Extensive Games

3.1 Some Preliminary Restrictions

3.2 The Axiom System

3.3 Pure and Mixed Strategies

3.4 Games with Perfect Information

3.5 A Reduction of the Game Matrix

3.6 An Instructive Example

3.7 Behavior Strategies and Perfect Recall

3.8 Simplified Poker Reconsidered

Notes

Chapter 4. Infinite Games

4.1 Some Preliminary Restrictions

4.2 An Illuminating Example

4.3 Mixed Strategies and Expectation

4.4 The Battle of the Maxmin versus Supinf

4.5 The Fundamental Theorem

4.6 The Solution of Games on the Unit Square

Notes

Index

A

B

C

D

E

F

G

H

I

K

L

M

N

P

Q

R

S

T

V

W

Z

The users who browse this book also browse


No browse record.