Polymatrix games and optimization problems
From MaRDI portal
Publication:463366
DOI10.1134/S0005117914040043zbMATH Open1297.91012OpenAlexW2138560586MaRDI QIDQ463366FDOQ463366
Authors: A. S. Strekalovskiĭ, R. 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
Recommendations
Nonconvex programming, global optimization (90C26) Noncooperative games (91A10) (n)-person games, (n>2) (91A06)
Cites Work
- Equilibrium points in n -person games
- Equilibria of Polymatrix Games
- Three modeling paradigms in mathematical programming
- Equilibrium Points of Bimatrix Games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-person nonzero-sum games and quadratic programming
- Title not available (Why is that?)
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Equilibrium Points in Finite Games
- Equilibrium Points of Bimatrix Games
Cited In (16)
- Optimization approach to Berge equilibrium for bimatrix game
- Local search in quadratic two-person game
- A Global Optimization Approach to Nonzero Sum Six-Person Game
- A computational method for solving \(n\)-person game
- On the performance of managers and controllers: a polymatrix game approach for the manager-controller-board of directors' conflict
- A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
- Oligopolistic banking sector of Mongolia and polymatrix games of three players
- Search for Nash equilibria in bimatrix games with probability and quantile payoff functions
- On computational search for Nash equilibrium in hexamatrix games
- A note on polymatrix games
- Max Plus Algebra, Optimization and Game Theory
- A global optimization algorithm for solving a four-person game
- The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game
- Polyhedral end games for polynomial continuation
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games
- Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings
This page was built for publication: Polymatrix games and optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463366)
