A computational method for solving \(n\)-person game
From MaRDI portal
Publication:2405332
zbMath1414.91009MaRDI QIDQ2405332
N. Tungalag, Alexander Yu. Gornov, Rentsen Enkhbat, Anton S. Anikin, Sukhee Batbileg
Publication date: 22 September 2017
Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)
(n)-person games, (n>2) (91A06) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items
A note on anti-Nash equilibrium for bimatrix game, The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polymatrix games and optimization problems
- Global optimality conditions for nonconvex optimization
- Two-person nonzero-sum games and quadratic programming
- Equilibrium Points in Finite Games
- Equilibria of Polymatrix Games
- On computational search for Nash equilibrium in hexamatrix games