SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3
10 references·1 citing·30 second hop
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3 (2013)Polylogarithmic Supports Are Required for…The Complexity of Computing a Nash Equilibrium (2009)The Complexity of Computing a…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…An Optimization Approach for Approximate Nash Equilibria (2008)An Optimization Approach for …A note on approximate Nash equilibria (2008)A note on approximate Nash eq…Progress in approximate nash equilibria (2007)Progress in approximate nash …Approximating nash equilibria using small-support strategies (2007)Approximating nash equilibria…Reducibility among equilibrium problems (2006)Reducibility among equilibriu…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…Approximate Well-Supported Nash Equilibria Below Two-Thirds (2012)Approximate Well-Supported Na…Non-Cooperative Games (1951)The complexity of pure Nash equilibria (2004)A Note on Approximate Nash Equilibria (2006)Computing Equilibria in Anonymous Games (2007)On oblivious PTAS's for nash equilibrium (2009)Theory of games and economic behavior (2019)Zur Theorie der Gesellschaftsspiele (1928)Equilibrium Points of Bimatrix Games (1964)Intrinsic robustness of the price of anarchy (2009)Games on Networks (2014)Core Challenges of Social Robot Navigation: A Survey (2023)Elimination of Randomization in Certain Statistical Decision Procedures and Zero-Sum Two-Person Games (1951)Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games (2006)Non-cooperative games (1989)Settling the Complexity of Two-Player Nash Equilibrium (2006)New Algorithms for Approximate Nash Equilibria in Bimatrix Games (2007)Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games (2016)Algorithms, games, and the internet (2001)Learning equilibria of games via payoff queries (2013)Bounds for the query complexity of approximate equilibria (2014)Bounds for the Query Complexity of Approximate Equilibria (2016)Mixed-Integer Programming Methods for Finding Nash Equilibria (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)The complexity of computing a Nash equilibrium (2006)Computing Approximate Nash Equilibria in Polymatrix Games (2015)An Optimization Approach for Approximate Nash Equilibria (2007)The Complexity of Finding Nash Equilibria (2007)
this work references cited by second hop

References

  • 2009The Complexity of Computing a Nash Equilibrium922 cited
  • 2003Playing large games using simple strategies387 cited
  • 2007Progress in approximate nash equilibria149 cited
  • 2008A note on approximate Nash equilibria143 cited
  • 2006Reducibility among equilibrium problems141 cited
  • 1994On sparse approximations to randomized strategies and convex combinations123 cited
  • 2008An Optimization Approach for Approximate Nash Equilibria95 cited
  • 2007Approximating nash equilibria using small-support strategies83 cited
  • 2009New algorithms for approximate Nash equilibria in bimatrix games71 cited
  • 2008Well Supported Approximate Equilibria in Bimatrix Games53 cited

Cited by

  • 2012Approximate Well-Supported Nash Equilibria Below Two-Thirds32 cited

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