SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Hard-to-Solve Bimatrix Games
12 references·9 citing·35 second hop
Hard-to-Solve Bimatrix Games (2006)Hard-to-Solve Bimatrix GamesGambit: Software Tools for Game Theory (2006)Gambit: Software Tools for Ga…Playing large games using simple strategies (2003)Playing large games using sim…Computing equilibria for two-person games (2002)Computing equilibria for two-…Complexity Results about Nash Equilibria (2002)Complexity Results about Nash…Algorithms, games, and the internet (2001)Algorithms, games, and the in…Algorithmic Mechanism Design (2001)Algorithmic Mechanism DesignNon-cooperative games (1989)Non-cooperative gamesNash and correlated equilibria: Some complexity considerations (1989)Nash and correlated equilibri…A note on the Lemke-Howson algorithm (1974)A note on the Lemke-Howson al…Computing Equilibria of N -Person Games (1971)Computing Equilibria of N -Pe…Equilibrium Points of Bimatrix Games (1964)Equilibrium Points of Bimatri…Non-Cooperative Games (1951)Non-Cooperative GamesHeuristics Can Withstand Environmental and Strategic Uncertainty (2018)Heuristics Can Withstand Envi…Game Theory Explorer: software for the applied game theorist (2014)Game Theory Explorer: softwar…Constant rank bimatrix games are PPAD-hard (2014)Constant rank bimatrix games …The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions (2013)The Complexity of the Homotop…Rank-1 bimatrix games (2011)Rank-1 bimatrix gamesComputing equilibria: a computational complexity perspective (2009)Computing equilibria: a compu…Well Supported Approximate Equilibria in Bimatrix Games (2008)Well Supported Approximate Eq…Equilibrium Computation for Two-Player Games in Strategic and Extensive Form (2007)Equilibrium Computation for T…Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (2007)Efficient Algorithms for Cons…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)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Optimal Auction Design (1981)A Course in Game Theory (1994)Truth revelation in approximately efficient combinatorial auctions (2002)A survey on networking games in telecommunications (2004)Worst-case equilibria (2009)Reexamination of the perfectness concept for equilibrium points in extensive games (1975)Stability and Perfection of Nash Equilibria (1989)Quantal Response Equilibria for Extensive Form Games (1998)A Framework for Applied Dynamic Analysis in I.O. (2000)Robust game theory (2006)Worst-Case Equilibria (1999)The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms (2003)The Price of Fairness (2011)Models of Bounded Rationality (1997)New complexity results about Nash equilibria (2008)The complexity of computing a Nash equilibrium (2009)Subjectivity and correlation in randomized strategies (1974)Intrinsic robustness of the price of anarchy (2009)Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model (2004)Prediction, Learning, and Games (2006)Theory of games and economic behavior (2019)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)Enumeration of Nash equilibria for two-player games (2009)Leadership games with convex strategy sets (2009)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
  • 2001Algorithmic Mechanism Design1,331 cited
  • 1964Equilibrium Points of Bimatrix Games1,246 cited
  • 2001Algorithms, games, and the internet1,107 cited
  • 1989Nash and correlated equilibria: Some complexity considerations406 cited
  • 2003Playing large games using simple strategies387 cited
  • 2006Gambit: Software Tools for Game Theory337 cited
  • 2002Complexity Results about Nash Equilibria234 cited
  • 2002Computing equilibria for two-person games194 cited
  • 1971Computing Equilibria of N -Person Games177 cited
  • 1974A note on the Lemke-Howson algorithm156 cited

Cited by

  • 2007Equilibrium Computation for Two-Player Games in Strategic and Extensive Form65 cited
  • 2009Computing equilibria: a computational complexity perspective60 cited
  • 2008Well Supported Approximate Equilibria in Bimatrix Games53 cited
  • 2013The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions40 cited

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

  • 2014Constant rank bimatrix games are PPAD-hard36 cited
  • 2011Rank-1 bimatrix games35 cited
  • 2014Game Theory Explorer: software for the applied game theorist34 cited
  • 2007Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games34 cited
  • 2018Heuristics Can Withstand Environmental and Strategic Uncertainty0 cited