A note on the Lemke-Howson algorithm

摘要: The Lemke-Howson algorithm for bimatrix games provides both an elementary proof of the existence equilibrium points and efficient computational method finding at least one point. first half this paper presents a geometrical view that makes its operation especially easy to visualize. Several illustrations are given, including Wilson’s example “inaccessible” points. second orientation theory (nondegenerate) paths interconnect them; in particular, it is shown there always more “negative” than “positive”