Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden 2 2 subgames

DOI10.1007/S00182-015-0513-7MaRDI QIDQ524983zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Endre Boros, Kazuhisa Makino, Vladimir Oudalov, Khaled Elbassioni, Vladimir Gurvich

Publication date 27 April 2017

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00182-015-0513-7

zbMATH Keywords

dual hypergraphsdualizationmatrix and bimatrix gamesNash equilibriumNash-solvabilitysaddle pointtransversal hypergraphs

Mathematics Subject Classification ID

2-person games (91A05) Noncooperative games (91A10)

Recommendations

• A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
• On pure equilibria for bimatrix games
• Pure Nash equilibria in finite two-person non-zero-sum games
• A necessary and sufficient condition of a mixed NE in bimatrix games
• Equilibria in constrained concave bimatrix games

Cites work

• A characterization of strategic complementarities.
• Absolutely determined matrices
• Acyclic, or totally tight, two-person game forms: characterization and main properties
• scientific article; zbMATH DE number 4095249 (Why is no real title available?)
• scientific article; zbMATH DE number 3205074 (Why is no real title available?)
• Minimal and locally minimal games and game forms
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Potential games
• The solvability of positional games in pure strategies
• Two more classes of games with the continuous-time fictitious play property
• Two-colourings that decompose perfect graphs
• Weak and strong monotone comparative statics

Cited in

(6)

• Minimal and locally minimal games and game forms
• The minimal hitting set generation problem: algorithms and computation
• On pure equilibria for bimatrix games
• A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
• Equilibria in constrained concave bimatrix games
• A necessary and sufficient condition of a mixed NE in bimatrix games

This page was built for publication: Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames

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