Chance, Strategy, and Choice: An Introduction to the Mathematics of Games and Elections

by Samuel Bruce Smith

Overview

Games and elections are fundamental activities in society with applications in economics, political science, and sociology. These topics offer familiar, current, and lively subjects for a course in mathematics. This classroom-tested textbook, primarily intended for a general education course in game theory at the freshman or sophomore level, provides an elementary treatment of games and elections. Starting with basics such as gambling, zero-sum and combinatorial games, Nash equilibria, social dilemmas, and fairness and impossibility theorems for elections, the text then goes further into the theory with accessible proofs of advanced topics such as the Sprague–Grundy theorem and Arrow's impossibility theorem. • Uses an integrative approach to probability, game, and social choice theory • Provides a gentle introduction to the logic of mathematical proof, thus equipping readers with the necessary tools for further mathematical studies • Contains numerous exercises and examples of varying levels of difficulty • Requires only a high school mathematical background.

Product Details

ISBN-13:	9781316028414
Publisher:	Cambridge University Press
Publication date:	06/29/2015
Series:	Cambridge Mathematical Textbooks
Sold by:	Barnes & Noble
Format:	eBook
File size:	6 MB

About the Author

Samuel Bruce Smith is Professor and Chair of Mathematics at Saint Joseph's University and a past Director of the University Honors Program. In 2012, he won the Tengelmann Award for Distinguished Teaching and Research.

Table of Contents

1. Introduction; 2. Games and elections; 3. Chance; 4. Strategy; 5. Choice; 6. Strategy and choice; 7. Choice and chance; 8. Chance and strategy; 9. Nash equilibria; 10. Proofs and counterexamples; 11. Laws of probability; 12. Fairness in elections; 13. Weighted voting; 14. Gambling games; 15. Zero-sum games; 16. Partial conflict games; 17. Take-away games; 18. Fairness and impossibility; 19. Paradoxes and puzzles in probability; 20. Combinatorial games; 21. Borda versus Condorcet; 22. The Sprague–Grundy theorem; 23. Arrow's impossibility theorem.

Editorial Reviews

"Sam Smith's book offers an intriguing juxtaposition of chance, strategy, and elections. The mathematical analysis is rigorous without being too formal or forbidding. The applications to topics in economics and political science - including auctions, power, and voting - as well as to parlor games like poker will engage both students and professionals."
Steven Brams, New York University

"I like the logical flow and length of the chapters and I like that the layout is simple (no excessively boxed theorems, etc.). There are numerous chapters, with one key concept explained in each. One could envision that each chapter would roughly be covered in a class period."
John Cullinan, Bard College, New York

"The author's approach does seem as if it would appeal to a broad range of instructors and students: there are enough chapters that an instructor could choose a collection of topics according to his or her interest. Furthermore, the inclusion of proof-based sections would allow an instructor to use the text for a course targeted at math majors and minors rather than at a general nontechnical audience."
James Parson, Hood College, Maryland

"The book is well written and interesting. Students should have little difficulty reading and understanding this book … The book covers the topics with clarity and applies game theory to "real-world" problems."
Dan Cunningham, State University of New York, Buffalo

"While some of Smith's material has origins more than 100 years old, the author engages the reader through modern developments, such as the minimax theorem (1928), the work of John Nash and Kenneth Arrow (1950s) and even more recent developments by Steven Brams, William Zwicker and Alan Taylor (1980s–2000s). The author does an effective job of presenting this material to an audience of non-science majors with no prerequisites. A unique feature of the text is the treatment of combinatorial games such as Nim and Hackenbush alongside traditional two person game theory."
David Vella, Skidmore College, New York

From the Publisher