Bimatrix games

Welcome to Bimatrix-Games

Bimatrix games is library of games useful for testing game theoretic algorithms. The library was built as an extension to the currently existing GAMUT library of games due to its lack of games which were hard to solve for approximate algorithms. With that in mind, we built this library as a test suite for approximation algorithms. There are currently two projects hosted :

• Algorithms http://bimatrix-games.github.io/eps-nash-algos : This contains implementations of various algorithms for the approximation of Nash equibrium. The algorithms implemented consist of DMP, BBM1, BBM2, TS and KS.
• Game Library http://bimatrix-games.github.io/bimatrix-generators : This contains the implementations of several classes of games which were introduced to study their properties with regards to approximation.

Related Papers

1. A. Deligkas, J. Fearnley, T.P. Igwe, and R. Savani (2016). An empirical study on computing equilibria in polymatrix games. In Proc. of the International conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (to appear).
2. J. Fearnley, T. P. Igwe, R. Savani (2015). An Empirical Study of Finding Approximate Equilibria in Bimatrix Games. International Symposium on Experimental Algorithms (SEA). arXiv