Hybrid global search algorithm with genetic blocks for solving hexamatrix games

DOI10.26516/1997-7670.2022.41.40zbMath1498.91004OpenAlexW4296051480MaRDI QIDQ2097315

Andrey Vasil'evich Orlov

Publication date: 11 November 2022

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: https://mathizv.isu.ru/en/article/file?id=1418

zbMATH Keywords

Nash equilibriumlocal searchgenetic algorithmglobal search theoryhexamatrix gameslevel surface approximationpolymatrix games of three players

Mathematics Subject Classification ID

Noncooperative games (91A10) Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Uses Software

• Genocop
• PLCP
• SQPlab

Cites Work

• Oligopolistic banking sector of Mongolia and polymatrix games of three players
• Polymatrix games and optimization problems
• Three modeling paradigms in mathematical programming
• Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• On a global search in D.C. optimization problems
• On Solving Optimization Problems with Hidden Nonconvex Structures
• Numerical solution of bilinear programming problems
• Global Search for Bilevel Optimization with Quadratic Data
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Introduction to evolutionary computing
• On computational search for Nash equilibrium in hexamatrix games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid global search algorithm with genetic blocks for solving hexamatrix games