On computational search for Nash equilibrium in hexamatrix games
From MaRDI portal
Publication:5963237
DOI10.1007/s11590-014-0833-8zbMath1336.91010OpenAlexW2035743862MaRDI QIDQ5963237
Andrey Vasil'evich Orlov, Alexander S. Strekalovsky, Sukhee Batbileg
Publication date: 4 March 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0833-8
Nash equilibriumlocal searchnonconvex optimization problemscomputational simulationglobal searchpolymatrix games
Noncooperative games (91A10) Nonconvex programming, global optimization (90C26) (n)-person games, (n>2) (91A06) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Related Items
A computational method for solving \(n\)-person game, A global optimization algorithm for solving a four-person game, The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game, Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings, A Global Optimization Approach to Nonzero Sum Six-Person Game, Preface to the special issue ``Recent developments in non-linear and global optimization, On a Solving Bilevel D.C.-Convex Optimization Problems, Hybrid global search algorithm with genetic blocks for solving hexamatrix games, Global Search for Bilevel Optimization with Quadratic Data, On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
Uses Software
Cites Work
- Polymatrix games and optimization problems
- Three modeling paradigms in mathematical programming
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- Perturbation approach to generalized Nash equilibrium problems with shared constraints
- On solving generalized Nash equilibrium problems via optimization
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Dual fast projected gradient method for quadratic programming
- On computational search for optimistic solutions in bilevel problems
- Introduction to Global Optimization Exploiting Space-Filling Curves
- On Solving Optimization Problems with Hidden Nonconvex Structures
- Equilibrium Points in Finite Games
- Numerical solution of bilinear programming problems
- On the continuity of the value of a linear program and of related polyhedral-valued multifunctions
- Numerical Optimization
- Equilibrium Points of Bimatrix Games
- Equilibrium points in n -person games
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
