Maximal nash subsets for bimatrix games
- 1 March 1981
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 28 (1) , 147-152
- https://doi.org/10.1002/nav.3800280111
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On nash subsets and mobility chains in bimatrix gamesNaval Research Logistics Quarterly, 1976
- On nash subsets of bimatrix gamesNaval Research Logistics Quarterly, 1974
- Structure of equilibria inN-person non-cooperative gamesInternational Journal of Game Theory, 1974
- Constructing bimatrix games with special propertiesNaval Research Logistics Quarterly, 1972
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Equilibrium Points of Bimatrix GamesJournal of the Society for Industrial and Applied Mathematics, 1964
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMESProceedings of the National Academy of Sciences, 1961
- Equilibrium Points in Bimatrix GamesTheory of Probability and Its Applications, 1958
- Non-Cooperative GamesAnnals of Mathematics, 1951
- Equilibrium points in n -person gamesProceedings of the National Academy of Sciences, 1950