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

DOI10.1007/BF01582124zbMath0413.90074MaRDI QIDQ3048610

Wayne P. Hallman, Ikuyo Kaneko

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

quadratic programminglinear complementarity problemcounter examplebimatrix gameheuristic procedurebounded 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)

Related Items (1)

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

Cites Work

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

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