In this chapter, we shall study if not the most practical then certainly an elegant application of linear programming. The subject is called game theory, and we shall focus on the simplest type of game, called the finite two-person zero-sum game, or just matrix game for short. Our primary goal shall be to prove the famous Minimax Theorem, which was first discovered and proved by John von Neumann in 1928. His original proof of this theorem was rather involved and depended on another beautiful theorem from mathematics, the Brouwer Fixed-Point Theorem. However, it eventually became clear that the solution of matrix games could be found by solving a certain linear programming problem and that the Minimax Theorem is just a fairly straightforward consequence of the Duality Theorem.
KeywordsNash Equilibrium Linear Programming Problem Pure Strategy Linear Complementarity Problem Payoff Matrix
- Chvátal, V. (1983). Linear programming. New York: Freeman.Google Scholar
- Dresher, M. (1961). Games of strategy: Theory and application. Englewood Cliffs: Prentice-Hall.Google Scholar
- Gale, D., Kuhn, H., and Tucker, A. (1951). Linear programming and the theory of games. In T. Koopmans (Ed.), Activity analysis of production and allocation (pp. 317–329). New York: Wiley.Google Scholar
- Karlin, S. (1959). Mathematical methods and theory in games, programming, and economics (Vols. 1 and 2). Reading: Addison-Wesley.Google Scholar
- Kuhn, H. (1950). A simplified two-person poker. Annals of Mathematics Studies, 24, 97–103.Google Scholar
- von Neumann, J., and Morgenstern, O. (1947). Theory of games and economic behavior (2nd ed.). Princeton: Princeton University Press.Google Scholar