Bimatrix games and bilinear programming
From MaRDI portal
Recommendations
Cited in
(26)- Global search in a noncovex optimal control problem
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- On the occasion of the 80th birthday of Professor O. V. Vasiliev (1939--2002)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
- A computational method for solving \(n\)-person game
- A global optimization algorithm for solving a four-person game
- Local search in quadratic two-person game
- Modern methods for solving nonconvex optimal control problems
- Oligopolistic banking sector of Mongolia and polymatrix games of three players
- scientific article; zbMATH DE number 50919 (Why is no real title available?)
- scientific article; zbMATH DE number 1999225 (Why is no real title available?)
- Fast Algorithms for Rank-1 Bimatrix Games
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- scientific article; zbMATH DE number 7235434 (Why is no real title available?)
- A Global Optimization Approach to Nonzero Sum Six-Person Game
- Constant rank bimatrix games are PPAD-hard
- On computational search for Nash equilibrium in hexamatrix games
- The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game
- Minimizing sequences in a constrained DC optimization problem
- Connection of some bilevel and nonlinear optimization problems
- The Hotelling bi-matrix game
- D. C. optimization approach for finding Berge equilibrium in bimatrix game
- Triangles of conflicts and hexamatrix games
- Recent advances in minimax problem and bimatrix games
- Optimization approach to Berge equilibrium for bimatrix game
This page was built for publication: Bimatrix games and bilinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5440984)