Some Tractable Win-Lose Games (Q3010417): Difference between revisions

@@ Property / arXiv ID @@
+.5951
@@ Property / arXiv ID: 1010.5951 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
+Normal rank
@@ Property / cites work @@
+An approach to the subgraph homeomorphism problem
@@ Property / cites work: An approach to the subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Settling the complexity of computing two-player Nash equilibria
+Normal rank
@@ Property / cites work @@
+Q2934593
@@ Property / cites work: Q2934593 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
+Normal rank
@@ Property / cites work @@
+The Complexity of Computing a Nash Equilibrium
@@ Property / cites work: The Complexity of Computing a Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space.
+Normal rank
@@ Property / cites work @@
+Dividing a Graph into Triconnected Components
@@ Property / cites work: Dividing a Graph into Triconnected Components / rank @@
+Normal rank
@@ Property / cites work @@
+Non-cooperative games
@@ Property / cites work: Non-cooperative games / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
+Normal rank
@@ Property / cites work @@
+NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
+Normal rank