The following pages link to Hard-to-Solve Bimatrix Games (Q5489083):
Displaying 47 items.
- On the convergence of the Lemke-Howson algorithm for bi-matrix games (Q308592) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Exponentiality of the exchange algorithm for finding another room-partitioning (Q496707) (← links)
- On Stackelberg mixed strategies (Q516242) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- A decomposition algorithm for \(N\)-player games (Q847797) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Games in oriented matroids (Q924938) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Computing the cores of strategic games with punishment-dominance relations (Q933749) (← links)
- On the complexity of deciding bimatrix games similarity (Q955038) (← links)
- Well supported approximate equilibria in bimatrix games (Q973002) (← links)
- Imitation games and computation (Q993779) (← links)
- Existence of equilibria in a decentralized two-level supply chain (Q1014973) (← links)
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739) (← links)
- Implementing the modified LH algorithm (Q1177222) (← links)
- Games with the total bandwagon property meet the Quint-Shubik conjecture (Q1621732) (← links)
- Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770) (← links)
- New interpretations of the higher Stasheff-Tamari orders (Q2166330) (← links)
- Strategic decompositions of normal form games: zero-sum games and potential games (Q2195713) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- Oriented Euler complexes and signed perfect matchings (Q2340282) (← links)
- Mature or emerging markets: competitive duopoly investment decisions (Q2355111) (← links)
- Game Theory Explorer: software for the applied game theorist (Q2356171) (← links)
- ReGale: some memorable results (Q2389290) (← links)
- A note on anti-Nash equilibrium for bimatrix game (Q2673539) (← links)
- Enumeration of all extreme equilibria of bimatrix games (Q2780527) (← links)
- On the exact polynomial time algorithm for a special class of bimatrix game (Q2799636) (← links)
- Finding Gale strings (Q2861535) (← links)
- On finding another room-partitioning of the vertices (Q2861564) (← links)
- Euler complexes (oiks) (Q2861567) (← links)
- The Exact Computational Complexity of Evolutionarily Stable Strategies (Q2937749) (← links)
- Euler Complexes (Q2971605) (← links)
- How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard? (Q3162503) (← links)
- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (Q3448815) (← links)
- A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities (Q3460332) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm (Q5219680) (← links)
- Constant rank bimatrix games are PPAD-hard (Q5259590) (← links)
- Approximate Equilibria for Strategic Two Person Games (Q5459968) (← links)
- Nash equilibria in random games with right fat-tailed distributions (Q6142571) (← links)
- Tropical Complementarity Problems and Nash Equilibria (Q6171260) (← links)
- Two-person adversarial games are zero-sum: an elaboration of a folk theorem (Q6636874) (← links)
