SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Reducibility among equilibrium problems
8 references·16 citing·31 second hop
Reducibility among equilibrium problems (2006)Reducibility among equilibrium problemsTheory of games and economic behavior (2019)Theory of games and economic …Graphical Models for Game Theory (2013)Graphical Models for Game The…The complexity of computing a Nash equilibrium (2006)The complexity of computing a…Computing correlated equilibria in multi-player games (2005)Computing correlated equilibr…The complexity of pure Nash equilibria (2004)The complexity of pure Nash e…Complexity Results about Nash Equilibria (2002)Complexity Results about Nash…Nash and correlated equilibria: Some complexity considerations (1989)Nash and correlated equilibri…Non-Cooperative Games (1951)Non-Cooperative GamesPolynomial-time computation of exact correlated equilibrium in compact games (2013)Polynomial-time computation o…On the Complexity of Approximating a Nash Equilibrium (2013)On the Complexity of Approxim…Action-Graph Games (2010)Action-Graph GamesOn oblivious PTAS's for nash equilibrium (2009)On oblivious PTAS's for nash …New algorithms for approximate Nash equilibria in bimatrix games (2009)New algorithms for approximat…Computing equilibria: a computational complexity perspective (2009)Computing equilibria: a compu…Well Supported Approximate Equilibria in Bimatrix Games (2008)Well Supported Approximate Eq…On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games (2008)On the Complexity of Pure-Str…Extensive-Form Correlated Equilibrium: Definition and Computational Complexity (2008)Extensive-Form Correlated Equ…New Algorithms for Approximate Nash Equilibria in Bimatrix Games (2007)New Algorithms for Approximat…Computing Equilibria in Anonymous Games (2007)Computing Equilibria in Anony…Nash equilibria in graphical games on trees revisited (2006)Nash equilibria in graphical …Computing pure nash equilibria in graphical games via markov random fields (2006)Computing pure nash equilibri…A Note on Approximate Nash Equilibria (2006)A Note on Approximate Nash Eq…The Computational Complexity of Nash Equilibria in Concisely Represented Games (2005)The Computational Complexity …The complexity of computing a Nash equilibrium (2005)The complexity of computing a…Equilibrium points in n -person games (1950)Stochastic Games (1953)Pure Nash Equilibria: Hard and Easy Games (2003)Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms (2004)Simple search methods for finding a Nash equilibrium (2006)Games and Decisions (2015)Non-cooperative games (1989)On the Complexity of Two-PlayerWin-Lose Games (2005)Prediction, Learning, and Games (2006)How long to equilibrium? The communication complexity of uncoupled equilibrium procedures (2008)Congestion Games with Player-Specific Payoff Functions (1996)Settling the Complexity of Two-Player Nash Equilibrium (2006)Discretized multinomial distributions and Nash equilibria in anonymous games (2008)Approximate Nash equilibria in anonymous games (2014)Theory of Games and Economic Behavior (1945)The myth of the Folk Theorem (2008)A class of games possessing pure-strategy Nash equilibria (1973)Potential Games (1996)The Price of Stability for Network Design with Fair Cost Allocation (2004)The price of anarchy of finite congestion games (2005)Subjectivity and correlation in randomized strategies (1974)Playing large games using simple strategies (2003)Intrinsic robustness of the price of anarchy (2009)Computing correlated equilibria in multi-player games (2008)The complexity of computing a Nash equilibrium (2009)Agent-Based Modeling in Economics and Finance: Past, Present, and Future (2025)Toward a positive theory of consumer choice (1980)Prospect theory: An analysis of decision under risk (1988)Computing the optimal strategy to commit to (2006)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

  • 2019Theory of games and economic behavior16,630 cited
  • 1951Non-Cooperative Games6,999 cited
  • 2004The complexity of pure Nash equilibria662 cited
  • 2013Graphical Models for Game Theory544 cited
  • 2006The complexity of computing a Nash equilibrium470 cited
  • 1989Nash and correlated equilibria: Some complexity considerations406 cited
  • 2002Complexity Results about Nash Equilibria234 cited
  • 2005Computing correlated equilibria in multi-player games151 cited

Cited by

  • 2009On oblivious PTAS's for nash equilibrium93 cited
  • 2007Computing Equilibria in Anonymous Games91 cited
  • 2006A Note on Approximate Nash Equilibria86 cited
  • 2013On the Complexity of Approximating a Nash Equilibrium84 cited
  • 2010Action-Graph Games84 cited
  • 2008Extensive-Form Correlated Equilibrium: Definition and Computational Complexity80 cited
  • 2006Computing pure nash equilibria in graphical games via markov random fields72 cited
  • 2009New algorithms for approximate Nash equilibria in bimatrix games

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

71 cited
  • 2013Polynomial-time computation of exact correlated equilibrium in compact games68 cited
  • 2006Nash equilibria in graphical games on trees revisited66 cited
  • 2007New Algorithms for Approximate Nash Equilibria in Bimatrix Games61 cited
  • 2009Computing equilibria: a computational complexity perspective60 cited
  • 2005The complexity of computing a Nash equilibrium58 cited
  • 2005The Computational Complexity of Nash Equilibria in Concisely Represented Games54 cited
  • 2008Well Supported Approximate Equilibria in Bimatrix Games53 cited
  • 2008On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games52 cited