PPAD-complete approximate pure Nash equilibria in Lipschitz games (Q6069844): Difference between revisions

@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lipschitz Games
@@ Property / cites work: Lipschitz Games / rank @@
+Normal rank
@@ Property / cites work @@
+Best-reply dynamics in large binary-choice anonymous games
+Normal rank
@@ Property / cites work @@
+Propositional proofs and reductions between NP search problems
+Normal rank
@@ 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 @@
+Privacy and Truthful Equilibrium Selection for Aggregative Games
+Normal rank
@@ Property / cites work @@
+Q5365081
@@ Property / cites work: Q5365081 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Nash equilibria in anonymous games
@@ Property / cites work: Approximate Nash equilibria in anonymous games / rank @@
+Normal rank
@@ Property / cites work @@
+Stability in large Bayesian games with heterogeneous players
+Normal rank
@@ Property / cites work @@
+Computing approximate Nash equilibria in polymatrix games
+Normal rank
@@ Property / cites work @@
+The complexity of gradient descent: CLS = PPAD ∩ PLS
+Normal rank
@@ Property / cites work @@
+Lower bounds for the query complexity of equilibria in Lipschitz games
+Normal rank
@@ Property / cites work @@
+Logarithmic query complexity for approximate Nash computation in large games
+Normal rank
@@ Property / cites work @@
+Query complexity of approximate equilibria in anonymous games
+Normal rank
@@ Property / cites work @@
+Pseudo-deterministic Proofs
@@ Property / cites work: Pseudo-deterministic Proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Fault tolerance in large games
@@ Property / cites work: Fault tolerance in large games / rank @@
+Normal rank
@@ Property / cites work @@
+Q5605644
@@ Property / cites work: Q5605644 / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+On total functions, existence theorems and computational complexity
+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 @@
+Inapproximability of Nash Equilibrium
@@ Property / cites work: Inapproximability of Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Nash Equilibria in Concisely Represented Games
+Normal rank