A global optimization algorithm for solving a four-person game

DOI10.1007/s11590-017-1181-2zbMath1422.91042OpenAlexW2747974541MaRDI QIDQ2421448

N. Tungalag, Evgeniya A. Finkelstein, Alexander Yu. Gornov, Anton S. Anikin, Sukhee Batbileg

Publication date: 17 June 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1181-2

zbMATH Keywords

Nash equilibriummixed strategiesglobal optimization algorithmnonzero sum game

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) (n)-person games, (n>2) (91A06)

Related Items

Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings

Uses Software

• GAMUT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polymatrix games and optimization problems
• Three modeling paradigms in mathematical programming
• Perturbation approach to generalized Nash equilibrium problems with shared constraints
• On solving generalized Nash equilibrium problems via optimization
• Simple search methods for finding a Nash equilibrium
• Nash and correlated equilibria: Some complexity considerations
• Global optimality conditions for nonconvex optimization
• The maximal number of regular totally mixed Nash equilibria
• 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

This page was built for publication: A global optimization algorithm for solving a four-person game