Hard-to-Solve Bimatrix Games
From MaRDI portal
Publication:5489083
Recommendations
Cited in
(58)- On the complexity of deciding bimatrix games similarity
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Unit vector games
- An oddity property for two-person games
- ReGale: some memorable results
- On finding another room-partitioning of the vertices
- Constant rank two-player games are PPAD-hard
- Games with the total bandwagon property meet the Quint-Shubik conjecture
- Implementing the modified LH algorithm
- Substitution with satiation: a new class of utility functions and a complementary pivot algorithm
- Existence of equilibria in a decentralized two-level supply chain
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- Euler complexes
- Understanding PPA-completeness
- New complexity results about Nash equilibria
- Finding Gale strings
- Fast Algorithms for Rank-1 Bimatrix Games
- How do you like your equilibrium selection problems? Hard, or very hard?
- Some tractable win-lose games
- On the convergence of the Lemke-Howson algorithm for bi-matrix games
- Game Theory Explorer: software for the applied game theorist
- A note on anti-Nash equilibrium for bimatrix game
- Nash equilibria in random games with right fat-tailed distributions
- Equilibria, fixed points, and complexity classes
- Recent development in computational complexity characterization of Nash equilibrium
- Constant rank bimatrix games are PPAD-hard
- Approximate Equilibria for Strategic Two Person Games
- ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria
- Oriented Euler complexes and signed perfect matchings
- Imitation games and computation
- New interpretations of the higher Stasheff-Tamari orders
- Random bimatrix games are asymptotically easy to solve (a simple proof)
- scientific article; zbMATH DE number 3904373 (Why is no real title available?)
- Well supported approximate equilibria in bimatrix games
- Two-person adversarial games are zero-sum: an elaboration of a folk theorem
- Exploiting concavity in bimatrix games: new polynomially tractable subclasses
- Efficient decomposition of bimatrix games (extended abstract)
- Exponentiality of the exchange algorithm for finding another room-partitioning
- The complexity of the homotopy method, equilibrium selection and Lemke-Howson solutions
- scientific article; zbMATH DE number 3847256 (Why is no real title available?)
- Tropical Complementarity Problems and Nash Equilibria
- Rank-1 bimatrix games, a homeomorphism and a polynomial time algorithm
- Strategic decompositions of normal form games: zero-sum games and potential games
- Games in oriented matroids
- Semidefinite programming for min-max problems and games
- Euler complexes (oiks)
- Computing the cores of strategic games with punishment-dominance relations
- A decomposition algorithm for N-player games
- scientific article; zbMATH DE number 4118196 (Why is no real title available?)
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
- Enumeration of all extreme equilibria of bimatrix games
- Computing equilibria: a computational complexity perspective
- scientific article; zbMATH DE number 4135740 (Why is no real title available?)
- On the exact polynomial time algorithm for a special class of bimatrix game
- On Stackelberg mixed strategies
- Mature or emerging markets: competitive duopoly investment decisions
This page was built for publication: Hard-to-Solve Bimatrix Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5489083)
