Approximating Nash Equilibria in Tree Polymatrix Games (Q3449601): Difference between revisions

@@ Property / cites work @@
+Q5365039
@@ Property / cites work: Q5365039 / rank @@
+Normal rank
@@ Property / cites work @@
+Settling the complexity of computing two-player Nash equilibria
+Normal rank
@@ Property / cites work @@
+On the Complexity of Approximating a Nash Equilibrium
+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 @@
+A note on approximate Nash equilibria
@@ Property / cites work: A note on approximate Nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+On a Network Generalization of the Minmax Theorem
@@ Property / cites work: On a Network Generalization of the Minmax Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Approximate Nash Equilibria in Polymatrix Games
+Normal rank
@@ Property / cites work @@
+Equilibria of Polymatrix Games
@@ Property / cites work: Equilibria of Polymatrix Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q3496342
@@ Property / cites work: Q3496342 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of Nash Equilibrium
@@ Property / cites work: Inapproximability of Nash Equilibrium / rank @@
+Normal rank