Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games

9 references·9 citing·26 second hop

FromToDepth

this work references cited by second hop

References

1951Non-Cooperative Games6,999 cited
1964Equilibrium Points of Bimatrix Games1,246 cited
2006Settling the Complexity of Two-Player Nash Equilibrium493 cited
2006The complexity of computing a Nash equilibrium470 cited
2003Playing large games using simple strategies387 cited
2005Three-Player Games Are Hard150 cited
2007Progress in approximate nash equilibria149 cited
1994On sparse approximations to randomized strategies and convex combinations123 cited
2007An Optimization Approach for Approximate Nash Equilibria105 cited

Cited by

2008An Optimization Approach for Approximate Nash Equilibria95 cited
2007Computing Equilibria in Anonymous Games91 cited
2006A Note on Approximate Nash Equilibria86 cited
2013On the Complexity of Approximating a Nash Equilibrium84 cited
2009New algorithms for approximate Nash equilibria in bimatrix games71 cited
2008The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond70 cited
2007New Algorithms for Approximate Nash Equilibria in Bimatrix Games

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

61 cited

2008Well Supported Approximate Equilibria in Bimatrix Games53 cited

2008Discretized multinomial distributions and Nash equilibria in anonymous games50 cited