This is a preview of subscription content, log in via an institution to check access.
References
V. Aggarwal, “On the generation of all equilibrium points for bimatrix games through the Lemke—Howson algorithm”,Mathematical Programming 4 (1973) 233–234.
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).
M. Bastian, “Fast fastkomplementäre Iterationspfade zur Bestimmung von Gleichgewichtspunkten in Bimatrixspielen”,Proceedings in operations research 4 (1974) 141–152.
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).
C.E. Lemke and J.T. Howson, Jr., “Equilibrium points of bimatrix games”,SIAM Journal of Applied Mathematics 12 (1964) 413–423.
M.J. Todd, “Comments on a Note by Aggarwal”,Mathematical Programming 10 (1976) 130–133.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bastian, M. Another note on bimatrix games. Mathematical Programming 11, 299–300 (1976). https://doi.org/10.1007/BF01580398
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580398