On proper refinement of Nash equilibria for bimatrix games
From MaRDI portal
Publication:1941251
DOI10.1016/j.automatica.2011.07.013zbMath1259.91006OpenAlexW2015813577MaRDI QIDQ1941251
Pierre Hansen, Charles Audet, Slim Belhaiza
Publication date: 12 March 2013
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2011.07.013
Related Items (3)
Refinement of pure Pareto Nash equilibria in finite multicriteria games using preference relations ⋮ Finite uniform approximation of two-person games defined on a product of staircase-function infinite spaces ⋮ A note on bimatrix game maximal Selten subsets
Cites Work
- Unnamed Item
- On the set of proper equilibria of a bimatrix game
- Strictly perfect equilibrium points of bimatrix games
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Regular equilibrium points of bimatrix games
- Reexamination of the perfectness concept for equilibrium points in extensive games
- On the structure of the set of perfect equilibria in bimatrix games
- A note on bimatrix game maximal Selten subsets
- Oddness of the number of equilibrium points: a new proof
- Enumeration of All Extreme Equilibria of Bimatrix Games
- A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES
- Regularity and Stability of Equilibrium Points of Bimatrix Games
- On nash subsets of bimatrix games
- Refinements of the Nash equilibrium concept
- Refinements of the Nash equilibrium concept
- Concavity cuts for disjoint bilinear programming
This page was built for publication: On proper refinement of Nash equilibria for bimatrix games