PPAD-complete approximate pure Nash equilibria in Lipschitz games
From MaRDI portal
Publication:6069844
Cites work
- Approximate Nash equilibria in anonymous games
- Best-reply dynamics in large binary-choice anonymous games
- Computational Complexity
- Computing approximate Nash equilibria in polymatrix games
- Fault tolerance in large games
- How easy is local search?
- scientific article; zbMATH DE number 6783433 (Why is no real title available?)
- scientific article; zbMATH DE number 3326981 (Why is no real title available?)
- Inapproximability of Nash equilibrium
- Lipschitz games
- Logarithmic query complexity for approximate Nash computation in large games
- Lower bounds for the query complexity of equilibria in Lipschitz games
- Non-cooperative games
- On minmax theorems for multiplayer games
- On the complexity of the parity argument and other inefficient proofs of existence
- On total functions, existence theorems and computational complexity
- Privacy and truthful equilibrium selection for aggregative games
- Propositional proofs and reductions between NP search problems
- Pseudo-deterministic proofs
- Query complexity of approximate equilibria in anonymous games
- Settling the complexity of computing two-player Nash equilibria
- Stability in large Bayesian games with heterogeneous players
- The complexity of gradient descent: CLS = PPAD ∩ PLS
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
Cited in
(2)
This page was built for publication: PPAD-complete approximate pure Nash equilibria in Lipschitz games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069844)
