On pure equilibria for bimatrix games

DOI10.1007/BF01414215zbMATH Open0795.90087MaRDI QIDQ3142160FDOQ3142160

Authors: Peter Jurg, Mathijs Jansen, Stef Tijs 

Publication date: 8 December 1993

Published in: ZOR - Methods and Models of Operations Research (Search for Journal in Brave)

Recommendations

• Pure Nash equilibria in finite two-person non-zero-sum games
• Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames
• On some saddle point matrices and applications to completely mixed equilibrium in bimatrix games
• Equilibria in constrained concave bimatrix games
• scientific article; zbMATH DE number 1496243

zbMATH Keywords

directed graphbimatrix gamepure equilibriaminimal cyclesbinary gameexistence of pure saddlepoints

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)

Cited In (26)

• Index and stability in bimatrix games. A geometric-combinatorial approach.
• On comparing equilibrium and optimum payoffs in a class of discrete bimatrix games
• On the Determinateness of m × ∞-Bimatrix Games
• On the structure of the set of perfect equilibria in bimatrix games
• A generalization of the Nash equilibrium theorem on bimatrix games
• Perturbation theory of completely mixed bimatrix games
• A necessary and sufficient condition of a mixed NE in bimatrix games
• On mutual concavity and strategically-zero-sum bimatrix games
• A theorem on the number of Nash equilibria in a bimatrix game
• Title not available (Why is that?)
• On some saddle point matrices and applications to completely mixed equilibrium in bimatrix games
• On some saddle point matrices and applications to completely mixed equilibrium in bimatrix games
• Existence of equilibrium points for bimatrix game with interval payoffs
• Title not available (Why is that?)
• A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
• On two-player games with pure strategies on intervals \([a,b]\) and comparisons with the two-player, two-strategy matrix case
• Constructing bimatrix games with unique equilibrium points
• On the determinateness of semi-infinite bimatrix games
• On loss aversion in bimatrix games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fall back equilibrium for \(2 \times n\) bimatrix games
• Choice of solution in one-step bimatrix games
• On the set of proper equilibria of a bimatrix game
• Strictly perfect equilibrium points of bimatrix games
• Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames

This page was built for publication: On pure equilibria for bimatrix games

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