Fast Algorithms for Rank-1 Bimatrix Games
From MaRDI portal
Publication:4994178
DOI10.1287/opre.2020.1981zbMath1470.91066arXiv1812.04611OpenAlexW3032969489MaRDI QIDQ4994178
No author found.
Publication date: 17 June 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.04611
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Games of fixed rank: a hierarchy of bimatrix games
- Enumeration of Nash equilibria for two-player games
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Nash and correlated equilibria: Some complexity considerations
- A geometric view of parametric linear programming
- Sensitivity analysis in linear programming: Just be careful!
- New maximal numbers of equilibria in bimatrix games
- Finding an interior point in the optimal face of linear programs
- On the complexity of the parity argument and other inefficient proofs of existence
- A global Newton method to compute Nash equilibria.
- Two-person nonzero-sum games and quadratic programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- Non-cooperative games
- Row Rank Equals Column Rank
- Market equilibrium under separable, piecewise-linear, concave utilities
- On the Complexity of Nash Equilibria and Other Fixed Points
- Settling the complexity of computing two-player Nash equilibria
- Smoothed analysis of algorithms
- Enumerating the Nash equilibria of rank 1-games
- Computational complexity of parametric linear programming
- Maximal nash subsets for bimatrix games
- Computing Simply Stable Equilibria
- Constant Rank Two-Player Games are PPAD-hard
- On the Strategic Stability of Equilibria
- The Complexity of Computing a Nash Equilibrium
- A friendly smoothed analysis of the simplex method
- Equilibrium Points of Bimatrix Games
- Equilibrium Points of Bimatrix Games
- Rank-1 bimatrix games
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- Hard-to-Solve Bimatrix Games
- Bimatrix Equilibrium Points and Mathematical Programming
- On the computation of stable sets and strictly perfect equilibria.
