The first four chapters develop combinatorial game theory, beginning with an introduction to game trees and mathematical induction, then investigating the games of Nim and Hackenbush. The analysis of these games concludes with the cornerstones of the Sprague-Grundy Theorem and the Simplicity Principle.
The last eight chapters of the book offer a scenic journey through the mathematical highlights of classical game theory. This contains a thorough treatment of zero-sum games and the von Neumann Minimax Theorem, as well as a student-friendly development and proof of the Nash Equilibrium Theorem. The Folk Theorem, Arrow's voting paradox, evolutionary biology, cake cutting, and other engaging auxiliary topics also appear.
The book is designed as a textbook for an undergraduate mathematics class. With ample material and limited dependencies between the chapters, the book is adaptable to a variety of situations and a range of audiences. Instructors, students, and independent readers alike will appreciate the flexibility in content choices as well as the generous sets of exercises at various levels.
Publisher: American Mathematical Society
Number of pages: 343
Dimensions: 216 x 140 mm
"The topics covered here are chosen for a broad and versatile look at the subject, the writing style is clear and enjoyable, examples are plentiful, and there is a good selection of exercises, both computational and proof-oriented...In addition to clear and engaging writing, and a good selection of exercises, this book also boasts an excellent bibliography...I have no hesitation whatsoever recommending it as a text for an introductory undergraduate course." - Mark Hunacek, MAA Reviews
You may also be interested in...
Would you like to proceed to the App store to download the Waterstones App?
Please note that owing to current COVID-19 restrictions, many of our shops are closed. Find out more by clicking here.