New algorithms for approximate Nash equilibria in bimatrix games (Q1041233): Difference between revisions

@@ Property / cites work @@
+On sparse approximations to randomized strategies and convex combinations
+Normal rank
@@ Property / cites work @@
+New algorithms for approximate Nash equilibria in 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 @@
+A note on approximate Nash equilibria
@@ Property / cites work: A note on approximate Nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Nash Equilibria and Other Fixed Points
+Normal rank
@@ Property / cites work @@
+Reducibility among equilibrium problems
@@ Property / cites work: Reducibility among equilibrium problems / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for approximating Nash equilibria of bimatrix games
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
+Normal rank
@@ Property / cites work @@
+Non-cooperative games
@@ Property / cites work: Non-cooperative games / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimization Approach for Approximate Nash Equilibria
+Normal rank
@@ Property / cites work @@
+Approximate Equilibria for Strategic Two Person Games
+Normal rank