SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Approximate Nash Equilibria for Multi-player Games
15 references·1 citing·34 second hop
Approximate Nash Equilibria for Multi-player Games (2008)Approximate Nash Equilibria for Multi-pla…An Optimization Approach for Approximate Nash Equilibria (2008)An Optimization Approach for …Progress in approximate nash equilibria (2007)Progress in approximate nash …New Algorithms for Approximate Nash Equilibria in Bimatrix Games (2007)New Algorithms for Approximat…Convergence to approximate Nash equilibria in congestion games (2007)Convergence to approximate Na…Approximating nash equilibria using small-support strategies (2007)Approximating nash equilibria…An Optimization Approach for Approximate Nash Equilibria (2007)An Optimization Approach for …The 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…A Note on Approximate Nash Equilibria (2006)A Note on Approximate Nash Eq…Three-Player Games Are Hard (2005)Three-Player Games Are HardExponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game (2004)Exponentially Many Steps for …Playing large games using simple strategies (2003)Playing large games using sim…Non-cooperative games (1989)Non-cooperative gamesEquilibrium Points of Bimatrix Games (1964)Equilibrium Points of Bimatri…Non-Cooperative Games (1951)Non-Cooperative GamesSimple approximate equilibria in large games (2014)Simple approximate equilibria…Equilibrium points in n -person games (1950)Studies in the Economics of Transportation. (1956)A class of games possessing pure-strategy Nash equilibria (1973)Fast convergence to nearly optimal solutions in potential games (2008)Regret minimization and the price of total anarchy (2008)Convergence to approximate Nash equilibria in congestion games (2009)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)Theory of games and economic behavior (2019)Algorithmic Mechanism Design (2001)On the Complexity of Two-PlayerWin-Lose Games (2005)The complexity of computing a Nash equilibrium (2005)Lossless abstraction of imperfect information games (2007)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 Finding Nash Equilibria (2007)On oblivious PTAS's for nash equilibrium (2009)Graphical Models for Game Theory (2013)The Core of an N Person Game (1967)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Complexity of Computing a Nash Equilibrium (2009)Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games (2006)A note on approximate Nash equilibria (2008)Agent-Based Modeling in Economics and Finance: Past, Present, and Future (2025)Reexamination of the perfectness concept for equilibrium points in extensive games (1975)Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model (2004)Prediction, Learning, and Games (2006)Subjectivity and correlation in randomized strategies (1974)Covenants with and without a Sword: Self-Governance Is Possible (1992)A theory of sequential reciprocity (2003)
this work references cited by second hop

References

  • 1951Non-Cooperative Games6,999 cited
  • 1989Non-cooperative games5,594 cited
  • 1964Equilibrium Points of Bimatrix Games1,246 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
  • 2005Three-Player Games Are Hard150 cited
  • 2007Progress in approximate nash equilibria149 cited
  • 2007Convergence to approximate Nash equilibria in congestion games133 cited
  • 2004Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game106 cited
  • 2007An Optimization Approach for Approximate Nash Equilibria105 cited
  • 2008An Optimization Approach for Approximate Nash Equilibria95 cited
  • 2006A Note on Approximate Nash Equilibria86 cited
  • 2007Approximating nash equilibria using small-support strategies83 cited
  • 2007New Algorithms for Approximate Nash Equilibria in Bimatrix Games61 cited

Cited by

  • 2014Simple approximate equilibria in large games

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

33 cited