Hybrid global search algorithm with genetic blocks for solving hexamatrix games

DOI10.26516/1997-7670.2022.41.40MaRDI QIDQ2097315zbMATH OpenOpenAlexFDO

Authors Andrey Vasil'evich Orlov

Publication date 11 November 2022

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

local searchgenetic algorithmNash equilibriumglobal search theoryhexamatrix gameslevel surface approximationpolymatrix games of three players

Mathematics Subject Classification ID

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

Recommendations

• On computational search for Nash equilibrium in hexamatrix games
• A global optimization algorithm for solving a four-person game
• Polymatrix games and optimization problems
• Seeking the equilibrium situations in bimatrix games
• Applications of genetic differentiation algorithm in solving many person noncooperative game's Nash equilibrium

Cites work

• scientific article; zbMATH DE number 702365 (Why is no real title available?)
• scientific article; zbMATH DE number 7040802 (Why is no real title available?)
• Bimatrix games and bilinear programming
• Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
• Game theory
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Global search for bilevel optimization with quadratic data
• Introduction to evolutionary computing
• Mathematical game theory and applications
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Numerical search for the equilibria in bimatrix games
• Numerical solution of bilinear programming problems
• Oligopolistic banking sector of Mongolia and polymatrix games of three players
• On a global search in D.C. optimization problems
• On computational search for Nash equilibrium in hexamatrix games
• On solving optimization problems with hidden nonconvex structures
• Polymatrix games and optimization problems
• Three modeling paradigms in mathematical programming

Cited in

(1)

• On computational search for Nash equilibrium in hexamatrix games

Describes a project that uses

Uses Software

• Genocop
• PLCP
• SQPlab

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097315)