| Softcover ISBN: | 978-1-4704-2210-3 |
| Product Code: | STML/80 |
| List Price: | $59.00 |
| Individual Price: | $47.20 |
| eBook ISBN: | 978-1-4704-3597-4 |
| Product Code: | STML/80.E |
| List Price: | $49.00 |
| Individual Price: | $39.20 |
| Softcover ISBN: | 978-1-4704-2210-3 |
| eBook: ISBN: | 978-1-4704-3597-4 |
| Product Code: | STML/80.B |
| List Price: | $108.00 $83.50 |
| Softcover ISBN: | 978-1-4704-2210-3 |
| Product Code: | STML/80 |
| List Price: | $59.00 |
| Individual Price: | $47.20 |
| eBook ISBN: | 978-1-4704-3597-4 |
| Product Code: | STML/80.E |
| List Price: | $49.00 |
| Individual Price: | $39.20 |
| Softcover ISBN: | 978-1-4704-2210-3 |
| eBook ISBN: | 978-1-4704-3597-4 |
| Product Code: | STML/80.B |
| List Price: | $108.00 $83.50 |
-
Book DetailsStudent Mathematical LibraryVolume: 80; 2016; 343 ppMSC: Primary 91
This book offers a gentle introduction to the mathematics of both sides of game theory: combinatorial and classical. The combination allows for a dynamic and rich tour of the subject united by a common theme of strategic reasoning.
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.
ReadershipUndergraduate students, graduate students, and researchers interested in game theory.
-
Table of Contents
-
Chapters
-
Chapter 1. Combinatorial games
-
Chapter 2. Normal-play games
-
Chapter 3. Impartial games
-
Chapter 4. Hackenbush and partizan games
-
Chapter 5. Zero-sum matrix games
-
Chapter 6. Von Neumann’s Minimax Theorem
-
Chapter 7. General games
-
Chapter 8. Nash equilibrium and applications
-
Chapter 9. Nash’s Equilibrium Theorem
-
Chapter 10. Cooperation
-
Chapter 11. $n$-player games
-
Chapter 12. Preferences and society
-
Appendix A. On games and numbers
-
Appendix B. Linear programming
-
Appendix C. Nash equilibrium in high dimensions
-
-
Additional Material
-
Reviews
-
'Game theory: a playful introduction' is exactly as the title claims: an interactive introduction to the subject. It is a well-written text which starts with a thorough analysis of combinatorial game theory before smoothly transitioning to classical game theory...Not only is the text readable, but there are also an adequate number of exercises at the end of each chapter. These exercises are structured as a scaffold beginning with a check of basic skills and building up to challenging proofs...Overall, this text is a well-structured, well-written introduction to game theory.
Brittany Shelton, Mathematical Reviews -
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
-
-
RequestsReview Copy – for publishers of book reviewsDesk Copy – for instructors who have adopted an AMS textbook for a courseExamination Copy – for faculty considering an AMS textbook for a coursePermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Additional Material
- Reviews
- Requests
This book offers a gentle introduction to the mathematics of both sides of game theory: combinatorial and classical. The combination allows for a dynamic and rich tour of the subject united by a common theme of strategic reasoning.
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.
Undergraduate students, graduate students, and researchers interested in game theory.
-
Chapters
-
Chapter 1. Combinatorial games
-
Chapter 2. Normal-play games
-
Chapter 3. Impartial games
-
Chapter 4. Hackenbush and partizan games
-
Chapter 5. Zero-sum matrix games
-
Chapter 6. Von Neumann’s Minimax Theorem
-
Chapter 7. General games
-
Chapter 8. Nash equilibrium and applications
-
Chapter 9. Nash’s Equilibrium Theorem
-
Chapter 10. Cooperation
-
Chapter 11. $n$-player games
-
Chapter 12. Preferences and society
-
Appendix A. On games and numbers
-
Appendix B. Linear programming
-
Appendix C. Nash equilibrium in high dimensions
-
'Game theory: a playful introduction' is exactly as the title claims: an interactive introduction to the subject. It is a well-written text which starts with a thorough analysis of combinatorial game theory before smoothly transitioning to classical game theory...Not only is the text readable, but there are also an adequate number of exercises at the end of each chapter. These exercises are structured as a scaffold beginning with a check of basic skills and building up to challenging proofs...Overall, this text is a well-structured, well-written introduction to game theory.
Brittany Shelton, Mathematical Reviews -
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
