Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames

DOI10.1007/s00182-015-0513-7zbMath1388.91003OpenAlexW2154435904WikidataQ59560482 ScholiaQ59560482MaRDI QIDQ524983

Kazuhisa Makino, Endre Boros, Vladimir Oudalov, Khaled M. Elbassioni, Vladimir A. 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

Nash equilibriumdualizationsaddle pointNash-solvabilitydual hypergraphsmatrix and bimatrix gamestransversal hypergraphs

Mathematics Subject Classification ID

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

Related Items

The Minimal Hitting Set Generation Problem: Algorithms and Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Absolutely determined matrices
• Two more classes of games with the continuous-time fictitious play property
• Acyclic, or totally tight, two-person game forms: characterization and main properties
• Minimal and locally minimal games and game forms
• A characterization of strategic complementarities.
• Weak and strong monotone comparative statics
• Potential games
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• Two-colourings that decompose perfect graphs
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• The solvability of positional games in pure strategies

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