A note on bimatrix game maximal Selten subsets
From MaRDI portal
Publication:2254918
DOI10.1007/s40065-014-0101-xzbMath1308.91007OpenAlexW2125170054WikidataQ59323085 ScholiaQ59323085MaRDI QIDQ2254918
Slim Belhaiza, Charles Audet, Pierre Hansen
Publication date: 6 February 2015
Published in: Arabian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40065-014-0101-x
Applications of mathematical programming (90C90) Noncooperative games (91A10) Linear programming (90C05) 2-person games (91A05)
Related Items
On proper refinement of Nash equilibria for bimatrix games, On perfect Nash equilibria of polymatrix games
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Enumeration of Nash equilibria for two-player games
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Pareto optimality, game theory and equilibria
- Reexamination of the perfectness concept for equilibrium points in extensive games
- On the structure of the set of perfect equilibria in bimatrix games
- On proper refinement of Nash equilibria for bimatrix games
- Two-person nonzero-sum games and quadratic programming
- Enumeration of All Extreme Equilibria of Bimatrix Games
- Equilibrium Points in Finite Games
- A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES
- Maximal nash subsets for bimatrix games
- On nash subsets and mobility chains in bimatrix games
- On nash subsets of bimatrix games
- Equilibrium Points of Bimatrix Games
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- Algorithm 457: finding all cliques of an undirected graph
- Equilibrium points in n -person games
- Refinements of the Nash equilibrium concept
