Maximal nash subsets for bimatrix games

DOI10.1002/NAV.3800280111MaRDI QIDQ3902865zbMATHOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES

Cited in

(23)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902865)