GSoC/GCI Archive
Google Summer of Code 2012 The Gambit Project

All Possible Equilibrium reachable by the Lemke-Howson algorithm

by Tobenna Peter Igwe for The Gambit Project

The Nash Equilibrium of a bi-matrix game can be computed by using the Lemke-Howson algorithm. The aim of the project is to add the functionality of finding all of the possible equilibrium points which which can be reached by this algorithm.