Approximate Equilibria for Strategic Two Person Games (Q5459968): Difference between revisions

@@ Property / cites work @@
+On sparse approximations to randomized strategies and convex combinations
+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 @@
+Nash and correlated equilibria: Some complexity considerations
+Normal rank
@@ Property / cites work @@
+Reducibility among equilibrium problems
@@ Property / cites work: Reducibility among equilibrium problems / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
+Normal rank
@@ Property / cites work @@
+Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
+Normal rank
@@ Property / cites work @@
+Equilibrium Points of Bimatrix Games
@@ Property / cites work: Equilibrium Points of Bimatrix Games / 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 @@
+Algorithms, games, and the internet
@@ Property / cites work: Algorithms, games, and the internet / rank @@
+Normal rank
@@ Property / cites work @@
+Hard-to-Solve Bimatrix Games
@@ Property / cites work: Hard-to-Solve Bimatrix Games / rank @@
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
+Normal rank