Resolving Conflicts with Mathematica

Algorithms for two-person games

Morton John Canty

328 pages, parution le 22/08/2003

Ajouter à une liste

Indisponible

Résumé

The revised and updated edition of this popular German textbook is unique in its emphasis on algorithmic methods and in its original use of Mathematica as a tool to obtain solutions to game-theoretical models.

Resolving Conflicts with Mathematica begins with the basic theory of extensive and normal form games, as well as introducing the fundamental concept of Nash equilibria. The restriction to two-person games helps to make the material more digestible for the beginner. In later chapters the subtleties of degenerate games are discussed thoroughly. Many aspects of equilibrium selection theory are treated, including algorithms for determining evolutionary stable equilibria in biology. Finally, the book looks at the wide-scale application of game theory to practical conflict situations.

Resolving Conflicts with Mathematica includes a set of Mathematica programs which implement all of the algorithms described in the text. Exercises are closely integrated with the book's material and Mathematica 'notebooks' are supplied with each of the chapters.

Facilitates interactive learning with a free CD-ROM containing;
all Mathematica programs
chapter-by-chapter examples and exercises
full solutions to exercises

Provides realistic examples of applications of game theory, including discussions of Poker and Othello.

Non-cooperative games
Linear complementary
Zero-sum Games
Degenerate Games
Inspection Games
Evolutionary Games
Gamas in extensive Form

A Lemke and Howson
B Game theory "Bimatrix"
C Solutions to th exercises
Mathematical notation

L'auteur - Morton John Canty

Senior Scientist, Juelich Research Center, Germany

Caractéristiques techniques

	PAPIER
Éditeur(s)	Apress
Auteur(s)	Morton John Canty
Parution	22/08/2003
Nb. de pages	328
Format	17 x 24,5
Couverture	Relié
Poids	790g
Intérieur	Noir et Blanc
EAN13	9780121588557
ISBN13	978-0-12-158855-7