Back to Gambit: The package for computation in game theory
GSoC 2026

Development and integration of Lemke’s algorithm package

Lemke's algorithm is a method for solving Linear Complementarity Problems (LCPs). Computing equilibria for two-player games can be reduced to solving such problems. The Gambit library already has a C++ implementation of Lemke's algorithm, but the goal of this project is to improve and integrate Bernhard von Stengel's Lemke package written in Python. The current package works primarily as a standalone CLI tool, with algorithm logic, file I/O, and console output all tightly coupled. This project will transform it into a dual-purpose package – usable both from the command line and as an importable Python library that Gambit can directly call.

Project details

Contributor

Natalie Mesablishvili

Mentors

Not available

Technologies

Not listed in the archive