A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
From MaRDI portal
Publication:3503628
DOI10.1007/978-3-540-79709-8_13zbMath1143.91308MaRDI QIDQ3503628
Endre Boros, Vladimir Oudalov, Kazuhisa Makino, Vladimir A. Gurvich, Khaled M. Elbassioni
Publication date: 5 June 2008
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79709-8_13
91A05: 2-person games
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Absolutely determined matrices
- Minimal and locally minimal games and game forms
- 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