SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Equilibrium Points in Bimatrix Games
2 references·15 citing·34 second hop
Equilibrium Points in Bimatrix Games (1958)Equilibrium Points in Bimatrix GamesTheory of Games and Statistical Decisions. (1955)Theory of Games and Statistic…Non-Cooperative Games (1951)Non-Cooperative GamesAction-Graph Games (2010)Action-Graph GamesEquilibrium Computation for Two-Player Games in Strategic and Extensive Form (2007)Equilibrium Computation for T…Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games (2006)Enumeration of All the Extrem…Solving three-player games by the matrix approach with application to an electric power market (2003)Solving three-player games by…Chapter 45 Computing equilibria for two-person games (2002)Chapter 45 Computing equilibr…New Maximal Numbers of Equilibria in Bimatrix Games (1999)New Maximal Numbers of Equili…Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games (1998)Cooperation and self-interest…Finding mixed strategies with small supports in extensive form games (1996)Finding mixed strategies with…Computing equilibria for two person games (1996)Computing equilibria for two …Stochastic Games with State Independent Transitions and Separable Rewards (1984)Stochastic Games with State I…Maximal nash subsets for bimatrix games (1981)Maximal nash subsets for bima…On equilibria in finite games (1979)On equilibria in finite gamesPolymatrix Games with Joint Constraints (1973)Polymatrix Games with Joint C…An Overview of the Mathematical Theory of Games (1972)An Overview of the Mathematic…On a Generalization of the Lemke–Howson Algorithm to Noncooperative N -Person Games (1971)On a Generalization of the Le…Reexamination of the perfectness concept for equilibrium points in extensive games (1975)Non-cooperative games (1989)Nash Equilibria via Polynomial Equations (2004)Computing equilibria: a computational complexity perspective (2009)An Extended N-Player Network Game and Simulation of Four Investment Strategies on a Complex Innovation Network (2016)Stability in Competition (1929)Stability in Competition (1990)Polynomial-time computation of exact correlated equilibrium in compact games (2011)Polynomial-time computation of exact correlated equilibrium in compact games (2013)Revenue optimization in the generalized second-price auction (2013)Equilibrium Points of Bimatrix Games (1964)Nonlinear programming and stationary equilibria in stochastic games (1991)A Fictitious Play Approach to Large-Scale Optimization (2005)An optimization formulation to compute Nash equilibrium in finite games (2009)Equilibrium points in n -person games (1950)Regularity and Stability of Equilibrium Points of Bimatrix Games (1981)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Chapter 18 The bargaining set, kernel, and nucleolus (1992)Theory of games and economic behavior (2019)Stability and Perfection of Nash Equilibria (1989)Games of fixed rank: a hierarchy of bimatrix games (2009)Uniqueness of Stationary Equilibrium Payoffs in Coalitional Bargaining (2011)Modern industrial organization (1990)Using co-evolutionary programming to simulate strategic behaviour in markets (1997)MULTI-LEADER-FOLLOWER GAMES: MODELS, METHODS AND APPLICATIONS (2015)The complexity of two-person zero-sum games in extensive form (1992)Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types (2012)Constant rank bimatrix games are PPAD-hard (2014)Team Decision Problems (1962)On Optimum Methods in Quickest Detection Problems (1963)The origin of predictable behavior (1983)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
  • 1955Theory of Games and Statistical Decisions.1,032 cited

Cited by

  • 1971On a Generalization of the Lemke–Howson Algorithm to Noncooperative N -Person Games98 cited
  • 2010Action-Graph Games84 cited
  • 1972An Overview of the Mathematical Theory of Games79 cited
  • 2002Chapter 45 Computing equilibria for two-person games74 cited
  • 2007Equilibrium Computation for Two-Player Games in Strategic and Extensive Form65 cited
  • 2003Solving three-player games by the matrix approach with application to an electric power market58 cited
  • 1981Maximal nash subsets for bimatrix games54 cited
  • 1999New Maximal Numbers of Equilibria in Bimatrix Games51 cited
  • 1998Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games49 cited
  • 1996Computing equilibria for two person games48 cited
  • 1979On equilibria in finite games45 cited
  • 1996Finding mixed strategies with small supports in extensive form games42 cited
  • 1984Stochastic Games with State Independent Transitions and Separable Rewards39 cited

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

1973
Polymatrix Games with Joint Constraints
38 cited
  • 2006Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games37 cited