Linear Programming pp 173-187 | Cite as

# Game Theory

## Abstract

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.

## Keywords

Nash Equilibrium Linear Programming Problem Pure Strategy Linear Complementarity Problem Payoff Matrix## Preview

Unable to display preview. Download preview PDF.

## Notes

- Neumann, J. (1928), ‘Zur Theorie der Gesselschaftschpiele’,
*Mathematische Annalen***100**, 295–320. 187Google 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’, John Wiley and Sons, New York, pp. 317–329. 87, 187Google Scholar - von Neumann, J., and Morgenstern, O. (1947),
*Theory of Games and Economic Behavior*, 2nd edn, Princeton University Press, Princeton, NJ. 187Google Scholar - Karlin, S. (1959),
*Mathematical Methods and Theory in Games*,*Programming*,*and Economics*, Vol. 1 and 2, Addison-Wesley, Reading, MA. 187Google Scholar - Dresher, M. (1961),
*Games of Strategy: Theory and Application*, Prentice-Hall, Englewood Cliffs, NJ. 187Google Scholar - Kuhn, H. (1950), ‘A simplified two-person poker’,
*Annals of Mathematics Studies***24**, 97–103. 187Google Scholar