On the generation of all equilibrium points for bimatrix games through the Lemke—Howson Algorithm

DOI10.1007/BF01584663zbMath0256.90057MaRDI QIDQ5671807

Vijaykumar Aggarwal

Publication date: 1973

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

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (5)

Implementing the modified LH algorithm ⋮ An associated maximization problem for two-person nonzero-sum separable games ⋮ Another note on bimatrix games ⋮ On the connectedness of the set of almost complementary paths of a linear complementarity problem ⋮ Deflation for semismooth equations

Cites Work

• Equilibrium Points of Bimatrix Games

This page was built for publication: On the generation of all equilibrium points for bimatrix games through the Lemke—Howson Algorithm