Resolving Conflicts with Mathematica : Algorithms for Two-Person Games

Book Description
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.


Buy from Amazon     Compare Prices

This revised and updated edition of the popular German textbook is unique in its emphasis on algorithmic methods and in its original use of the computer algebra system Mathematica as a tool to obtain both numerical as well as analytical solutions to game-theoretical models. It covers such topics as extensive and normal form games, degeneracy and equilibrium selection theory - including evolutionarily stable equilibria, and Selten's perfect equilibria.


Buy from Barnes & Noble     Compare Prices