SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Computing Approximate Nash Equilibria in Polymatrix Games
14 references·1 citing·38 second hop
Computing Approximate Nash Equilibria in Polymatrix Games (2015)Computing Approximate Nash Equilibria in …Inapproximability of Nash Equilibrium (2015)Inapproximability of Nash Equ…Approximate Nash equilibria in anonymous games (2014)Approximate Nash equilibria i…On the Complexity of Approximating a Nash Equilibrium (2013)On the Complexity of Approxim…On Minmax Theorems for Multiplayer Games (2011)On Minmax Theorems for Multip…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…New complexity results about Nash equilibria (2008)New complexity results about …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 …Playing large games using simple strategies (2003)Playing large games using sim…Computing Nash equilibria by iterated polymatrix approximation (2003)Computing Nash equilibria by …Equilibria of Polymatrix Games (1972)Equilibria of Polymatrix GamesA survey on algorithms for Nash equilibria in finite normal-form games (2023)A survey on algorithms for Na…Non-Cooperative Games (1951)Resource allocation and the public sector (1967)Non-cooperative games (1989)Approximating Nash Equilibria in Tree Polymatrix Games (2015)Query Complexity of Approximate Nash Equilibria (2016)Communication complexity of approximate Nash equilibria (2017)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)Equilibrium points in n -person games (1950)Stochastic Games (1953)Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model (1967)Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game (2004)Learning and Approximating the Optimal Strategy to Commit To (2009)Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games (2010)Computing Equilibria of N -Person Games (1971)An Overview of the Mathematical Theory of Games (1972)Chapter 51 Inspection games (2002)Homotopy methods to compute equilibria in game theory (2009)Settling the Complexity of Two-Player Nash Equilibrium (2006)An Optimization Approach for Approximate Nash Equilibria (2007)The Complexity of Finding Nash Equilibria (2007)Existence of an Equilibrium for a Competitive Economy (1954)On the Complexity of Nash Equilibria in Anonymous Games (2015)A Mean Field Game of Optimal Portfolio Liquidation * (2018)New Algorithms for Approximate Nash Equilibria in Bimatrix Games (2007)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)Exposition of a New Theory on the Measurement of Risk (1954)Inapproximability of Nash Equilibrium (2018)Models of Bounded Rationality (1997)Complexity Results about Nash Equilibria (2002)The complexity of computing a Nash equilibrium (2009)Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games (2006)The complexity of computing a Nash equilibrium (2006)
this work references cited by second hop

References

  • 2009The Complexity of Computing a Nash Equilibrium922 cited
  • 2003Playing large games using simple strategies387 cited
  • 2008New complexity results about Nash equilibria212 cited
  • 2007Progress in approximate nash equilibria149 cited
  • 2008A note on approximate Nash equilibria143 cited
  • 1972Equilibria of Polymatrix Games124 cited
  • 2008An Optimization Approach for Approximate Nash Equilibria95 cited
  • 2014Approximate Nash equilibria in anonymous games85 cited
  • 2013On the Complexity of Approximating a Nash Equilibrium84 cited
  • 2015Inapproximability of Nash Equilibrium73 cited
  • 2009New algorithms for approximate Nash equilibria in bimatrix games71 cited
  • 2011On Minmax Theorems for Multiplayer Games61 cited
  • 2003Computing Nash equilibria by iterated polymatrix approximation57 cited
  • 2008Well Supported Approximate Equilibria in Bimatrix Games53 cited

Cited by

  • 2023A survey on algorithms for Nash equilibria in finite normal-form games30 cited

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