SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A Note on Approximate Nash Equilibria
6 references·10 citing·26 second hop
A Note on Approximate Nash Equilibria (2006)A Note on Approximate Nash EquilibriaThe complexity of computing a Nash equilibrium (2006)The complexity of computing a…Settling the Complexity of Two-Player Nash Equilibrium (2006)Settling the Complexity of Tw…Reducibility among equilibrium problems (2006)Reducibility among equilibriu…Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games (2006)Polynomial Algorithms for App…Playing large games using simple strategies (2003)Playing large games using sim…On sparse approximations to randomized strategies and convex combinations (1994)On sparse approximations to r…Query Complexity of Approximate Nash Equilibria (2016)Query Complexity of Approxima…On the Complexity of Approximating a Nash Equilibrium (2013)On the Complexity of Approxim…On the Performance of Approximate Equilibria in Congestion Games (2010)On the Performance of Approxi…New algorithms for approximate Nash equilibria in bimatrix games (2009)New algorithms for approximat…Well Supported Approximate Equilibria in Bimatrix Games (2008)Well Supported Approximate Eq…The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond (2008)The complexity of game dynami…New Algorithms for Approximate Nash Equilibria in Bimatrix Games (2007)New Algorithms for Approximat…Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games (2007)Gradient-Based Algorithms for…Approximating nash equilibria using small-support strategies (2007)Approximating nash equilibria…The complexity of computing a Nash equilibrium (2005)The complexity of computing a…Non-Cooperative Games (1951)Equilibrium Points of Bimatrix Games (1964)Computing Equilibria in Anonymous Games (2007)An Optimization Approach for Approximate Nash Equilibria (2008)The complexity of pure Nash equilibria (2004)On oblivious PTAS's for nash equilibrium (2009)Theory of games and economic behavior (2019)Zur Theorie der Gesellschaftsspiele (1928)Theory of Games and Economic Behavior (1946)Computing correlated equilibria in multi-player games (2008)Intrinsic robustness of the price of anarchy (2009)Elimination of Randomization in Certain Statistical Decision Procedures and Zero-Sum Two-Person Games (1951)Subjectivity and correlation in randomized strategies (1974)Designing networks with good equilibria (2007)Non-cooperative games (1989)Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games (2016)Equilibrium points in n -person games (1950)Exposition of a New Theory on the Measurement of Risk (1954)Inapproximability of Nash Equilibrium (2015)Inapproximability of Nash Equilibrium (2018)Models of Bounded Rationality (1997)Complexity Results about Nash Equilibria (2002)New complexity results about Nash equilibria (2008)The complexity of computing a Nash equilibrium (2009)Computing Approximate Nash Equilibria in Polymatrix Games (2015)Agent-Based Modeling in Economics and Finance: Past, Present, and Future (2025)
this work references cited by second hop

References

  • 2006Settling the Complexity of Two-Player Nash Equilibrium493 cited
  • 2006The complexity of computing a Nash equilibrium470 cited
  • 2003Playing large games using simple strategies387 cited
  • 2006Reducibility among equilibrium problems141 cited
  • 1994On sparse approximations to randomized strategies and convex combinations123 cited
  • 2006Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games102 cited

Cited by

  • 2013On the Complexity of Approximating a Nash Equilibrium84 cited
  • 2007Approximating nash equilibria using small-support strategies83 cited
  • 2009New algorithms for approximate Nash equilibria in bimatrix games71 cited
  • 2008The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond70 cited
  • 2010On the Performance of Approximate Equilibria in Congestion Games67 cited
  • 2007New Algorithms for Approximate Nash Equilibria in Bimatrix Games61 cited
  • 2005The complexity of computing a Nash equilibrium58 cited
  • 2008Well Supported Approximate Equilibria in Bimatrix Games53 cited
  • 2007Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games

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

53 cited
  • 2016Query Complexity of Approximate Nash Equilibria46 cited