Implementing the modified LH algorithm (Q1177222)

In this lengthy paper the authors give an explicit method to use a modified Lemke-Howson algorithm for the computation of equilibria in bimatrix games. The algorithm works for non-degenerate games only (as usual for Lemke/Howson-like algorithms). The advantage of this algorithm in contrast with other already known solution methods lies in the fact that the algorithm works directly on the payoff matrices \(A\) and \(B\) of the game. The authors prove that the algorithm works and provides an APL- program doing the job. There is no complexity analysis included.