Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Game theory : a classical introduction, mathematical games, and the tournament
McEachern A., Morgan & Claypool Publishers, San Rafael, CA, 2017. 118 pp. Type: Book (978-1-681731-58-2)
Date Reviewed: Feb 21 2018

A good definition of the word “game” in the context of game theory is provided in this book:

A game is any situation involving more than one individual, each of which can make more than one action, such that the outcome to each individual, called the payoff, is influenced by their own action, and the choice of action of at least one other individual. One way to think about game theory as a field is that it is a collection of theories and techniques that help us think about how to analyze a game.

From the definition above, it is easy to imagine the plethora of disciplines that use game theory. These include biology, artificial intelligence, economics, psychology, and computer science.

This book is divided into seven chapters. Chapter 1 introduces the text with a useful list of resources for those who need to refresh their knowledge on probabilities, graph theory, calculus, and so on, in order to tackle the subject of game theory. The chapter also covers the prisoner’s dilemma and finite state automata. Chapter 2 discusses games in extensive form with complete information and backward induction. Chapter 3 covers games in normal form and the Nash equilibrium. Chapter 4 discusses Nash equilibria and two-player zero-sum games. Chapter 5 is about mathematical games. This includes Nim, Sprouts, and deck-based games. Chapter 6 defines tournaments and their design. This includes round-robin scheduling. Finally, chapter 7 concludes the book with a brief discussion of future directions.

The text is easy to follow, clear, and concise, with no extraneous information. The author states that the actual text is a synthesis of his lecture notes. As a result, the book is intended for tutors of game theory rather than beginners. The reason is that its coverage of the tools and techniques used in the field does not include extensive details. It is still useful to learners as a guide rather than a self-contained tutorial. This probably explains the presence of exercises at the end of each chapter, for readers to test their knowledge of the covered material.

I would recommend it as a companion book on game theory rather than a beginner’s tutorial.

Reviewer:  Ghita Kouadri Review #: CR145867 (1805-0203)
Bookmark and Share
  Featured Reviewer  
 
Numerical Algorithms And Problems (F.2.1 )
 
 
Mathematics And Statistics (J.2 ... )
 
 
Applications (G.2.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Numerical Algorithms And Problems": Date
On the computational complexity of ordinary differential equations
Ko K. (ed) Information and Control 58(1-3): 157-194, 1984. Type: Article
Jun 1 1985
The computational complexity of simultaneous diophantine approximation problems
Lagarias J. SIAM Journal on Computing 14(1): 196-209, 1985. Type: Article
Jan 1 1986
Parallel and distributed computation: numerical methods
Bertsekas D., Tsitsiklis J., Prentice-Hall, Inc., Upper Saddle River, NJ, 1989. Type: Book (9789780136487005)
Apr 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy