Polymatrix games and optimization problems
From MaRDI portal
Publication:463366
DOI10.1134/S0005117914040043zbMath1297.91012OpenAlexW2138560586MaRDI QIDQ463366
Alexander S. Strekalovsky, Rentsen Enkhbat
Publication date: 16 October 2014
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117914040043
Noncooperative games (91A10) Nonconvex programming, global optimization (90C26) (n)-person games, (n>2) (91A06)
Related Items
Optimization approach to Berge equilibrium for bimatrix game, Local search in quadratic two-person game, Oligopolistic banking sector of Mongolia and polymatrix games of three players, A computational method for solving \(n\)-person game, Search for Nash equilibria in bimatrix games with probability and quantile payoff functions, 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, On computational search for Nash equilibrium in hexamatrix games, Hybrid global search algorithm with genetic blocks for solving hexamatrix games
Cites Work
- Three modeling paradigms in mathematical programming
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Two-person nonzero-sum games and quadratic programming
- Equilibrium Points in Finite Games
- Equilibrium Points of Bimatrix Games
- Equilibrium Points of Bimatrix Games
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- Equilibria of Polymatrix Games
- Equilibrium points in n -person games
- Unnamed Item
- Unnamed Item
- Unnamed Item
