Hybrid global search algorithm with genetic blocks for solving hexamatrix games
DOI10.26516/1997-7670.2022.41.40zbMATH Open1498.91004OpenAlexW4296051480MaRDI QIDQ2097315FDOQ2097315
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)
Full work available at URL: https://mathizv.isu.ru/en/article/file?id=1418
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
local searchgenetic algorithmNash equilibriumglobal search theoryhexamatrix gameslevel surface approximationpolymatrix games of three players
Nonconvex programming, global optimization (90C26) Noncooperative games (91A10) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Introduction to evolutionary computing
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- On solving optimization problems with hidden nonconvex structures
- Title not available (Why is that?)
- Three modeling paradigms in mathematical programming
- Bimatrix games and bilinear programming
- On a global search in D.C. optimization problems
- Oligopolistic banking sector of Mongolia and polymatrix games of three players
- Mathematical game theory and applications
- Polymatrix games and optimization problems
- Game theory
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Numerical solution of bilinear programming problems
- Numerical search for the equilibria in bimatrix games
- Title not available (Why is that?)
- Global search for bilevel optimization with quadratic data
- On computational search for Nash equilibrium in hexamatrix games
Cited In (1)
Uses Software
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)
