SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Three-Player Games Are Hard
1 references·16 citing·35 second hop
Three-Player Games Are Hard (2005)Three-Player Games Are HardGraphical Models for Game Theory (2013)Graphical Models for Game The…On the Complexity of Approximating a Nash Equilibrium (2013)On the Complexity of Approxim…Polynomial-time computation of exact correlated equilibrium in compact games (2011)Polynomial-time computation o…A Geometrical Perspective for the Bargaining Problem (2010)A Geometrical Perspective for…On oblivious PTAS's for nash equilibrium (2009)On oblivious PTAS's for nash …Computing equilibria: a computational complexity perspective (2009)Computing equilibria: a compu…Well Supported Approximate Equilibria in Bimatrix Games (2008)Well Supported Approximate Eq…Separable and low-rank continuous games (2008)Separable and low-rank contin…The Complexity of Finding Nash Equilibria (2007)The Complexity of Finding Nas…The approximation complexity of win-lose games (2007)The approximation complexity …The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (2006)The Game World Is Flat: The C…The Computational Complexity of Nash Equilibria in Concisely Represented Games (2006)The Computational Complexity …Sparse Games Are Hard (2006)Sparse Games Are HardPolynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games (2006)Polynomial Algorithms for App…Computing pure nash equilibria in graphical games via markov random fields (2006)Computing pure nash equilibri…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…Non-Cooperative Games (1951)Equilibrium Points of Bimatrix Games (1964)A Note on Approximate Nash Equilibria (2006)Settling the Complexity of Two-Player Nash Equilibrium (2006)Computing Equilibria in Anonymous Games (2007)An Optimization Approach for Approximate Nash Equilibria (2008)Subjectivity and correlation in randomized strategies (1974)Nash and correlated equilibria: Some complexity considerations (1989)Playing large games using simple strategies (2003)Uniqueness of Stationary Equilibrium Payoffs in Coalitional Bargaining (2011)Locating and protecting facilities from intentional attacks using secrecy (2017)Non-cooperative games (1989)Algorithms, games, and the internet (2001)On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games (2008)An Inquiry into the Nature and Causes of the Wealth of Nations (1776)Equilibrium points in n -person games (1950)Bounded Rationality and the Emergence of Simplicity Amidst Complexity (2012)Pareto optimality in coalition formation (2013)What Automaton Model Captures Decision Making? The Necessity of Behavioral Complexity (2015)Congestion Games with Player-Specific Payoff Functions (1996)The complexity of computing a Nash equilibrium (2006)Discretized multinomial distributions and Nash equilibria in anonymous games (2008)Approximate Nash equilibria in anonymous games (2014)Exposition of a New Theory on the Measurement of Risk (1954)Inapproximability of Nash Equilibrium (2015)Inapproximability of Nash Equilibrium (2018)Game Theory and Economic Modelling (1990)A Course in Game Theory (1994)Revenue management under horizontal and vertical competition within airline alliances (2015)Deterministic calibration and Nash equilibrium (2007)Theory of games and economic behavior (2019)Learning equilibria of games via payoff queries (2013)Bounds for the query complexity of approximate equilibria (2014)Computing Approximate Nash Equilibria in Polymatrix Games (2015)Computing the optimal strategy to commit to (2006)
this work references cited by second hop

References

  • 2013Graphical Models for Game Theory544 cited

Cited by

  • 2006Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games102 cited
  • 2007The Complexity of Finding Nash Equilibria98 cited
  • 2009On oblivious PTAS's for nash equilibrium93 cited
  • 2013On the Complexity of Approximating a Nash Equilibrium84 cited
  • 2006Computing pure nash equilibria in graphical games via markov random fields72 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
  • 2010A Geometrical Perspective for the Bargaining Problem49 cited
  • 2011Polynomial-time computation of exact correlated equilibrium in compact games49 cited
  • 2008Separable and low-rank continuous games44 cited
  • 2006The Computational Complexity of Nash Equilibria in Concisely Represented Games41 cited
  • 2006The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games41 cited

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

  • 2006Sparse Games Are Hard40 cited
  • 2007The approximation complexity of win-lose games38 cited