Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
From MaRDI portal
Publication:868531
DOI10.1007/s10957-006-9070-3zbMath1122.91009MaRDI QIDQ868531
Charles Audet, Pierre Hansen, Slim Belhaiza
Publication date: 6 March 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9070-3
91A10: Noncooperative games
91A05: 2-person games
91A06: (n)-person games, (n>2)
91B50: General equilibrium theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- New maximal numbers of equilibria in bimatrix games
- On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game
- Links between linear bilevel and mixed 0-1 programming problems
- A note on polymatrix games
- Two-person nonzero-sum games and quadratic programming
- Complementary pivot theory of mathematical programming
- Enumeration of All Extreme Equilibria of Bimatrix Games
- Equilibrium Points in Finite Games
- Bayesian Equilibria of Finite Two-Person Games with Incomplete Information
- On nash subsets of bimatrix games
- Equilibrium Points of Bimatrix Games
- Equilibrium Points of Bimatrix Games
- Bimatrix Equilibrium Points and Mathematical Programming
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- Equilibria of Polymatrix Games
- Polymatrix Games with Joint Constraints
- Equilibrium points in n -person games
