Triangles of conflicts and hexamatrix games
From MaRDI portal
Cites work
- A computational method for solving \(n\)-person game
- A global optimization algorithm for solving a four-person game
- A Global Optimization Approach to Nonzero Sum Six-Person Game
- A note on polymatrix games
- A note on solving 5-person game
- Bimatrix games and bilinear programming
- Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Equilibrium Points in Finite Games
- Equilibrium Points of Bimatrix Games
- Global optimization approach to nonzero sum n person game
- scientific article; zbMATH DE number 5994757 (Why is no real title available?)
- scientific article; zbMATH DE number 3850843 (Why is no real title available?)
- scientific article; zbMATH DE number 1255531 (Why is no real title available?)
- scientific article; zbMATH DE number 3453387 (Why is no real title available?)
- scientific article; zbMATH DE number 3326981 (Why is no real title available?)
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games
- Mathematical game theory and applications
- Oligopolistic banking sector of Mongolia and polymatrix games of three players
- On computational search for Nash equilibrium in hexamatrix games
- On solving optimization problems with hidden nonconvex structures
- Three modeling paradigms in mathematical programming
- Weak Berge equilibrium
This page was built for publication: Triangles of conflicts and hexamatrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6975290)
