On the connectedness of the set of almost complementary paths of a linear complementarity problem

DOI10.1007/BF01582124MaRDI QIDQ3048610zbMATH OpenFDO

Authors Wayne P. Hallman, Ikuyo Kaneko

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

quadratic programminglinear complementarity problemheuristic procedurebimatrix gamecounter examplebounded feasible regiontwo-person nonzero-sum gameconnectedness of the set of almost complementary paths

Mathematics Subject Classification ID

Quadratic programming (90C20) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• Another note on bimatrix games
• Bimatrix games—an addendum
• On the generation of all equilibrium points for bimatrix games through the Lemke—Howson Algorithm
• On triangulations for computing fixed points

Cited in

(1)

• An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method

This page was built for publication: On the connectedness of the set of almost complementary paths of a linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048610)