Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Approximating nash equilibria using small-support strategies

8 references·12 citing·31 second hop

FromToDepth

this work references cited by second hop

References

1951Non-Cooperative Games6,999 cited
1989Non-cooperative games5,594 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
2007Progress in approximate nash equilibria149 cited
1994On sparse approximations to randomized strategies and convex combinations123 cited
2006A Note on Approximate Nash Equilibria86 cited

Cited by

2016Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games72 cited
2009New algorithms for approximate Nash equilibria in bimatrix games71 cited
2007New Algorithms for Approximate Nash Equilibria in Bimatrix Games61 cited
2008Well Supported Approximate Equilibria in Bimatrix Games53 cited
2007Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games53 cited
2008Discretized multinomial distributions and Nash equilibria in anonymous games50 cited
2014Dynamic Reserve Prices for Repeated Auctions: Learning from Bids48 cited

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

2013

Learning equilibria of games via payoff queries

43 cited

2014Bounds for the query complexity of approximate equilibria39 cited

2008Approximate Nash Equilibria for Multi-player Games35 cited

2013Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/334 cited

2014On the communication complexity of approximate Nash equilibria32 cited