Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games

16 references·2 citing·33 second hop

FromToDepth

this work references cited by second hop

References

1951Non-Cooperative Games6,999 cited
1964Equilibrium Points of Bimatrix Games1,246 cited
2001Algorithms, games, and the internet1,107 cited
2006Settling the Complexity of Two-Player Nash Equilibrium493 cited
2006The complexity of computing a Nash equilibrium470 cited
1989Nash and correlated equilibria: Some complexity considerations406 cited
2003Playing large games using simple strategies387 cited
2005Internet and Network Economics318 cited
2002Complexity Results about Nash Equilibria234 cited
2005Three-Player Games Are Hard150 cited
2007Progress in approximate nash equilibria149 cited
2006Hard-to-Solve Bimatrix Games130 cited
1994On sparse approximations to randomized strategies and convex combinations123 cited
2006Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games102 cited
2005On the Complexity of Two-PlayerWin-Lose Games88 cited
2006A Note on Approximate Nash Equilibria86 cited

Cited by

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

2012Approximate Well-Supported Nash Equilibria Below Two-Thirds32 cited
2023A survey on algorithms for Nash equilibria in finite normal-form games30 cited