Maximal nash subsets for bimatrix games

DOI10.1002/nav.3800280111zbMath0454.90093OpenAlexW2093361315MaRDI QIDQ3902865

M. J. M. Jansen

Publication date: 1981

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800280111

zbMATH Keywords

maximal Nash subsetsequilibrium points of a bimatrix game

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items (23)

Projections and functions of Nash equilibria ⋮ Enumeration of Nash equilibria for two-player games ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ On strictly proper equilibria ⋮ On constructing games with a convex set of equilibrium strategies ⋮ On `informationally robust equilibria' for bimatrix games ⋮ A symmetrization for finite two-person games ⋮ Best-reply matching in games. ⋮ On the set of proper equilibria of a bimatrix game ⋮ Fall back equilibrium ⋮ A note on bimatrix game maximal Selten subsets ⋮ Equilibrium payoffs of finite games ⋮ Semi-algebraic sets and equilibria of binary games ⋮ Pareto equilibria for bimatrix games ⋮ On the structure of the set of perfect equilibria in bimatrix games ⋮ Epistemic considerations of decision making in games ⋮ The structure of the set of equilibria for two person multicriteria games. ⋮ An amalgation of games ⋮ A note on polymatrix games ⋮ Fast Algorithms for Rank-1 Bimatrix Games ⋮ NASH EQUILIBRIA FROM THE CORRELATED EQUILIBRIA VIEWPOINT ⋮ Polytope games ⋮ On weakly completely mixed bimatrix games

Cites Work

• AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
• Unnamed Item

This page was built for publication: Maximal nash subsets for bimatrix games