Advertisement

International Journal of Game Theory

, Volume 42, Issue 1, pp 165–177 | Cite as

The equivalence of linear programs and zero-sum games

  • Ilan Adler
Article

Abstract

In 1951, Dantzig showed the equivalence of linear programming problems and two-person zero-sum games. However, in the description of his reduction from linear programs to zero-sum games, he noted that there was one case in which the reduction does not work. This also led to incomplete proofs of the relationship between the Minimax Theorem of game theory and the Strong Duality Theorem of linear programming. In this note, we fill these gaps.

Keywords

Linear programming Zero-sum games Minimax theorem Strong duality Farkas’ lemma Villes’ theorem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adler I, Beling PA (1997) Polynomial algorithms for linear programming over the algebraic numbers. Algorithmica 12(6): 436–457CrossRefGoogle Scholar
  2. Carathodory C (1911) ber den variabilittsbereich der Fourierschen konstanten von positiven harmonischen Funktionen. Rend Circ Mat Palermo 32: 193–217CrossRefGoogle Scholar
  3. Dantzig GB (1951) A proof of the equivalence of the programming problem and the game problem. In: Koopmans TC (ed) Activity analysis of production and allocation. Wiley, New York, pp 330–335Google Scholar
  4. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, PrincetonGoogle Scholar
  5. Farkas J (1902) Uber die theorie der einfachen ungleichungen. J Reine Angew Math 124: 1–24Google Scholar
  6. Gale D, Kuhn HW, Tucker AW (1951) Linear programming and the theory of games. In: Koopmans TC (ed) Activity analysis of production and allocation. Wiley, New York, pp 317–329Google Scholar
  7. Gordan P (1873) Uber die auflosung lincarer Glcichungcn mit reellen coefficienten. Math Ann 6: 23–28CrossRefGoogle Scholar
  8. Luce RD, Raiffa H (1957) Games and decisions: introduction and critical survey. Wiley, New YorkGoogle Scholar
  9. Megiddo N (1990) On solving the linear programming problem approximately. Contemp Math 114: 35–50CrossRefGoogle Scholar
  10. Raghavan TES (1994) Zero-sum two-person games. In: Aumann RJ, Hart S (eds) Handbook of game theory with economic applications, vol 2. Elsevier, Amsterdam, pp 735–760CrossRefGoogle Scholar
  11. Tucker AW (1956) Dual systems of homogeneous linear relations. In: Kuhn HW, Tucker AW (eds) Linear inequalities and related systems. Annals of Mathematics Studies, vol 38. Princeton University Press, Princeton, pp 3–18Google Scholar
  12. Ville J (1938) Sur a theorie generale des jeux ou intervient Vhabilite des joueurs. Trait Calc Probab Appl IV 2: 105–113Google Scholar
  13. von Neumann J (1928) Zur theorie der gesellschaftsspiele. Math Ann 100: 295–320CrossRefGoogle Scholar
  14. von Neumann J, Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, PrincetonGoogle Scholar

Copyright information

© Springer-Verlag 2012

Authors and Affiliations

  1. 1.Department of IEORUniversity of CaliforniaBerkeleyUSA

Personalised recommendations