Total tightness implies Nash-solvability for three-person game forms (Q408181): Difference between revisions

@@ Property / cites work @@
+Acyclic, or totally tight, two-person game forms: characterization and main properties
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+The solvability of positional games in pure strategies
+Normal rank
@@ Property / cites work @@
+Q3821979
@@ Property / cites work: Q3821979 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
+Normal rank
@@ Property / cites work @@
+Acyclicity of improvements in finite game forms
@@ Property / cites work: Acyclicity of improvements in finite game forms / rank @@
+Normal rank
@@ Property / cites work @@
+Dominance Solvable Voting Schemes
@@ Property / cites work: Dominance Solvable Voting Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3332693
@@ Property / cites work: Q3332693 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5332984
@@ Property / cites work: Q5332984 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59560525
@@ Property / Wikidata QID: Q59560525 / rank @@
+Normal rank