A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames (Q3503628): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-79709-8_13
+Normal rank
@@ Property / OpenAlex ID @@
+W1597104213
@@ Property / OpenAlex ID: W1597104213 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal and locally minimal games and game forms
@@ Property / cites work: Minimal and locally minimal games and game forms / rank @@
+Normal rank
@@ Property / cites work @@
+Two-colourings that decompose perfect graphs
@@ Property / cites work: Two-colourings that decompose perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+Q3701227
@@ Property / cites work: Q3701227 / rank @@
+Normal rank
@@ Property / cites work @@
+On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
+Normal rank
@@ Property / cites work @@
+Absolutely determined matrices
@@ Property / cites work: Absolutely determined matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q5332984
@@ Property / cites work: Q5332984 / rank @@
+Normal rank