Mathematical Programming

, Volume 11, Issue 1, pp 299–300 | Cite as

Another note on bimatrix games

  • M. Bastian
Short Communication
Received:
Revised:

Keywords

Mathematical Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

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.Google Scholar
  2. [2]
    M. Bastian, “On the generation of extreme equilibrium points for bimatrix games by complementary pivoting”, Discussion Paper 7403, Lehrstuhl für Mathematische Verfahrensforschung, University of Göttingen (July 1974).Google Scholar
  3. [3]
    M. Bastian, “Fast fastkomplementäre Iterationspfade zur Bestimmung von Gleichgewichtspunkten in Bimatrixspielen”,Proceedings in operations research 4 (1974) 141–152.Google Scholar
  4. [4]
    T. Hansen and L. Mathiesen, “Generating stationary points for a non-concave quadratic program by Lemke's almost complementary pivot algorithm”, Discussion Paper 11/73, Norwegian School of Economics and Business Administration (Bergen, 1975).Google Scholar
  5. [5]
    C.E. Lemke and J.T. Howson, Jr., “Equilibrium points of bimatrix games”,SIAM Journal of Applied Mathematics 12 (1964) 413–423.Google Scholar
  6. [6]
    M.J. Todd, “Comments on a Note by Aggarwal”,Mathematical Programming 10 (1976) 130–133.Google Scholar

Copyright information

© The Mathematical Programming Society 1976

Authors and Affiliations

  • M. Bastian
    • 1
  1. 1.University of GöttingenGöttingenW.-Germany

Personalised recommendations