Gambit: The package for computation in game theory
Gambit is a set of software tools for doing computation on finite, noncooperative games in extensive or strategy form and a set of file formats for storing and communicating games to external tools. The Gambit Project was founded in the mid-1980s at the California Institute of Technology and to this day is actively developed by a community of contributors, with core development led by The Alan Turing Institute as part of its project: Automated analysis of strategic interactions.
GSoC Participation History
Technologies
Topics
Past Projects
Gambit Interoperability with SageMath
This project aims to enable SageMath to natively use Gambit’s functionality within its game-theory features, allowing seamless conversion between...
Implementing the Herings & Peeters Differentiable Homotopy in Gambit
The predictive power of game-theoretic analysis in n-person games is frequently undermined by the vast multiplicity of Nash equilibria. VISION: This...
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...
Frequently Asked Questions
Gambit: The package for computation in game theory | GSoC Org Profile & Stats - Learn about Gambit: The package for computation in game theory's involvement in Google Summer of Code (GSoC), their technologies, detailed reports.
Participation
Projects
Top Programming Languages
Project Difficulty Distribution
No difficulty data available