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, “Another note on bimatrix games”,Mathematical Programming 11 (1976) 299–300.
W.P. Hallman, unpublished notes.
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).
L. Mathiesen, private communication (August, 1974).
M.J. Todd, “Comments on a note by Aggarwal”,Mathematical Programming 10 (1976) 130–133.
M.J. Todd, “Bimatrix Games—An Addendum”,Mathematical Programming 14 (1978) 112–115.
Author information
Authors and Affiliations
Additional information
This research is supported, in part, by the National Science Foundation Grant No. ENG77-11136.
Rights and permissions
About this article
Cite this article
Hallman, W.P., Kaneko, I. On the connectedness of the set of almost complementary paths of a linear complementarity problem. Mathematical Programming 16, 384–385 (1979). https://doi.org/10.1007/BF01582124
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01582124