Equilibrium Points in Finite Games
From MaRDI portal
Cited in
(28)- Extra-proximal methods for solving two-person nonzero-sum games
- Constructing bimatrix games with unique equilibrium points
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Uniqueness of equilibrium points in bimatrix games
- Equilibrium points in special n-person games
- Nondominated Nash points: application of biobjective mixed integer programming
- About extreme equilibrium points
- A note on anti-Berge equilibrium for bimatrix game
- A note on bimatrix game maximal Selten subsets
- A computational method for solving \(n\)-person game
- A global optimization algorithm for solving a four-person game
- On a formulation of discrete, N-person non-cooperative games
- Local search in quadratic two-person game
- Search for Nash equilibria in bimatrix games with probability and quantile payoff functions
- A note on anti-Nash equilibrium for bimatrix game
- Un nuevo algoritmo para la resolucion de juegos bimatriciales
- A cutting plane algorithm for solving bilinear programs
- Polymatrix games and optimization problems
- Weak Berge equilibrium
- A Global Optimization Approach to Nonzero Sum Six-Person Game
- On computational search for Nash equilibrium in hexamatrix games
- The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix 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
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Jointly constrained bilinear programs and related problems: An overview
This page was built for publication: Equilibrium Points in Finite Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3279745)
