A collection of algorithms for approximation of Nash equilibrium. The algorithms implemented are stated below with their theoretic upper bounds:
[BBM1, BBM2] H. Bosse, J. Byrka, and E. Markakis. New algorithms for approximate Nash equilibria in bimatrix games. Theoretical Computer Science, 411(1):164–173, 2010.
[DMP] C. Daskalakis, A. Mehta and C. H. Papadimitriou. A note on approximate Nash equilibria. Theoretical Computer Science, 410(17): 1581-1588, 2009.
[KS+] J. Fearnley, P. W. Goldberg, R. Savani, and T. B. Sørensen. Approximate well-supported nash equilibria below two-thirds. CoRR, abs/1204.0707, 2012.
[KS] S. C. Kontogiannis and P. G. Spirakis. Well supported approximate equilibria in bimatrix games. Algorithmica, 57(4):653–667, 2010.
[TS] H. Tsaknakis and P. G. Spirakis. An optimization approach for approximate Nash equilibria. Internet Mathematics, 5(4):365–382, 2008.