Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 Preliminaries
- 2 Matrix Algebra
- 3 Graphical Linear Programming
- 4 Sensitivity Analysis and Duality
- 5 The Simplex Algorithm
- 6 Game Theory
- 7 More Game Theory
- 8 Sensitivity Analysis, Ordinal Games, and n-Person Games
- 9 More Linear Programming
- Appendix A Rapid Review of Sets and Probability
- References
- Index
- References
References
Published online by Cambridge University Press: 11 March 2021
Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 Preliminaries
- 2 Matrix Algebra
- 3 Graphical Linear Programming
- 4 Sensitivity Analysis and Duality
- 5 The Simplex Algorithm
- 6 Game Theory
- 7 More Game Theory
- 8 Sensitivity Analysis, Ordinal Games, and n-Person Games
- 9 More Linear Programming
- Appendix A Rapid Review of Sets and Probability
- References
- Index
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Publisher: Cambridge University PressPrint publication year: 2021
References
Bland, R. G. New finite pivoting rules for the simplex method. Mathematics of Operations Research, 2:103– 110, 1977.Google Scholar
Brams, Steven J. Rational Politics: Decisions, Games, and Strategy. Academic Press, 1985a.CrossRefGoogle Scholar
Brams, Steven J. Superpower Games: Applying Game Theory to Superpower Conflict. Yale University Press, 1985b.Google Scholar
Brickman, Louis. Mathematical Introduction to Linear Programming and Game Theory. Springer, 1989.CrossRefGoogle Scholar
Calvert, James E., and Voxman, William L. Linear Programming. Harcourt Brace Jovanovich, 1989.Google Scholar
Casti, John L. Five Golden Rules: Great Theories of 20th Century Mathematics and Why They Matter. Wiley, 1996.Google Scholar
Clark, John, and Holton, Derek Allan. A First Look at Graph Theory. World Scientific, 1991.Google Scholar
Hodge, Jonathan K., and Klima, Richard E. The Mathematics of Voting and Elections: A Hands-On Approach. American Mathematical Society, 2005.Google Scholar
Loomba, Narendra Paul. Linear Programming: A Managerial Perspective, 2nd ed. MacMillan, 1976.Google Scholar
Milnor, John. Games against nature. In Thrall et al., editors, Decision Processes, pages 49–59. Wiley, 1954.Google Scholar
Nash, Stephen G., and Sofer, Ariela. Linear and Nonlinear Programming. McGraw-Hill, 1996.Google Scholar
Robinson, E. Arthur Jr., and Ullman, Daniel H. A Mathematical Look at Politics. CRC Press, 2011.Google Scholar
Shapley, Lloyd, and Shubik, Martin. A method for evaluating the distribution of power in a committee system. American Political Science Review, 48:787–792, 1954.Google Scholar
Snyder, Glenn H. Prisoners dilemma and chicken models in international politics. International Studies Quarterly, 15:66–103, 1971.Google Scholar
Straffin, Philip D. Game Theory and Strategy. Mathematical Association of America, 1993.Google Scholar
Taylor, Alan D., and Pacelli, Allison M. Mathematics and Politics: Strategy, Voting, Power and Proof, 2nd ed. Springer, 2008.CrossRefGoogle Scholar
Taylor, Alan D., and Zwicker, William S. A characterization of weighted voting. Proceedings of the American Mathematical Society, 115:1089–1094, 1992.Google Scholar
Taylor, Alan D., and Zwicker, William S. Simple Games. Princeton University Press, 1999.Google Scholar
von Neumann, John, and Morgenstern, Oskar. Theory of Games and Economic Behavior. Princeton University Press, 1944.Google Scholar