Mathematical Programming

, Volume 10, Issue 1, pp 130–133 | Cite as

Comments on a Note by Aggarwal

  • Michael J. Todd
Short Communication

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    V. Aggarwal, “On the generation of all equilibrium points for bimatrix games through the Lemke—Howson algorithm”,Mathematical Programming 4 (1973) 233–234.MathSciNetCrossRefMATHGoogle Scholar
  2. [2]
    B.C. Eaves, “The linear complementarity problem”,Management Science 17 (1971) 612–634.MathSciNetCrossRefMATHGoogle Scholar
  3. [3]
    C.E. Lemke and J.T. Howson, Jr., “Equilibrium points of bimatrix games”,SIAM Journal 12 (1964) 413–423.MathSciNetMATHGoogle Scholar
  4. [4]
    L.S. Shapley, “A note on the Lemke—Howson algorithm”,Mathematical Programming Study 1 (1974) 175–189.MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© The Mathematical Programming Society 1976

Authors and Affiliations

  • Michael J. Todd
    • 1
  1. 1.Cornell UniversityIthacaUSA

Personalised recommendations