A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559): Difference between revisions

@@ Property / cites work @@
+Rank-1 bimatrix games
@@ Property / cites work: Rank-1 bimatrix games / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of NP-Complete Variants of Nash Equilibrium
+Normal rank
@@ Property / cites work @@
+Empirical Distribution of Equilibrium Play and Its Testing Application
+Normal rank
@@ Property / cites work @@
+Nash equilibria in random games
@@ Property / cites work: Nash equilibria in random games / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem
+Normal rank
@@ Property / cites work @@
+New algorithms for approximate Nash equilibria in bimatrix games
+Normal rank
@@ Property / cites work @@
+Approximating the best Nash Equilibrium in <i>n<sup>o</sup></i><sup>(log <i>n</i>)</sup>-time breaks the Exponential Time Hypothesis
+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 @@
+On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
+Normal rank
@@ Property / cites work @@
+Distributed Methods for Computing Approximate Equilibria
+Normal rank
@@ Property / cites work @@
+Distributed methods for computing approximate equilibria
+Normal rank
@@ Property / cites work @@
+Approximate Well-Supported Nash Equilibria in Symmetric 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 @@
+Approximating the existential theory of the reals
@@ Property / cites work: Approximating the existential theory of the reals / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability results for constrained approximate Nash equilibria
+Normal rank
@@ Property / cites work @@
+Computing approximate Nash equilibria in polymatrix games
+Normal rank
@@ Property / cites work @@
+Approximate well-supported Nash equilibria below two-thirds
+Normal rank
@@ Property / cites work @@
+On the communication complexity of approximate Nash equilibria
+Normal rank
@@ Property / cites work @@
+Games of fixed rank: a hierarchy of bimatrix games
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for approximating Nash equilibria of bimatrix games
+Normal rank
@@ Property / cites work @@
+Well supported approximate equilibria in bimatrix games
+Normal rank
@@ Property / cites work @@
+Sum-of-squares meets Nash: lower bounds for finding any equilibrium
+Normal rank
@@ Property / cites work @@
+Imitation games and computation
@@ Property / cites work: Imitation games and computation / rank @@
+Normal rank
@@ Property / cites work @@
+Simple complexity from imitation games
@@ Property / cites work: Simple complexity from imitation games / rank @@
+Normal rank
@@ Property / cites work @@
+Constant Rank Two-Player Games are PPAD-hard
@@ Property / cites work: Constant Rank Two-Player Games are PPAD-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Non-cooperative games
@@ Property / cites work: Non-cooperative games / rank @@
+Normal rank
@@ Property / cites work @@
+Random bimatrix games are asymptotically easy to solve (a simple proof)
+Normal rank
@@ Property / cites work @@
+Communication Complexity (for Algorithm Designers)
+Normal rank
@@ Property / cites work @@
+Inapproximability of Nash Equilibrium
@@ Property / cites work: Inapproximability of Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimization Approach for Approximate Nash Equilibria
+Normal rank