No article text was recorded for this version.
equilibrium computation complexity (PLS-completeness)
Version 1 of 136 papers52 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Equilibrium Computation in Multidimensional Congestion Games: CSP and Learning Dynamics Approaches
- Blog: Smoothed Efficient Algorithms and Reductions for Network Coordination Games
- Blog: Totally Unimodular Congestion Games
- Blog: Pure and Strong Nash Equilibrium Computation in Compactly Representable Aggregate Games
- Blog: Equilibrium Analysis of Customer Attraction Games
- Blog: Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412)
- Blog: In Congestion Games, Taxes Achieve Optimal Approximation
- Blog: Computational Aspects of Equilibria in Discrete Preference Games
- Blog: Public goods games in directed networks
- Blog: Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
- Blog: Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games
- Blog: Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions
- Blog: Computing Equilibrium Points of Electrostatic Potentials
- Blog: Networked Anti-coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence
- Blog: Computing Pure Nash Equilibria in Symmetric Action Graph Games
- Blog: The communication complexity of local search
- Blog: Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure
- Blog: Synchronisation Games on Hypergraphs
- Blog: Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners)
- Blog: On the Complexity of Nash Equilibrium Reoptimization
- Blog: Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria
- Blog: Schelling Games on Graphs
- Blog: Strategic Facility Location with Clients That Minimize Total Waiting Time
- Blog: Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case
- Blog: Learning Tree Structured Potential Games
- Blog: Algorithms and complexity for computing Nash equilibria in adversarial team games
- Blog: Computing Nash Equilibria in Generalized Interdependent Security Games
- Blog: Cost Minimization for Equilibrium Transition
- Blog: Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians
- Blog: Mechanism Design for Defense Coordination in Security Games
- Blog: The Complexity of Symmetric Bimatrix Games with Common Payoffs
- Blog: Schelling Games with Continuous Types
- Blog: Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games
- Blog: Inapproximability of Nash Equilibrium
- Blog: Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry
- Blog: On the complexity of nash dynamics and sink equilibria
History & citation
Current · Permanent link
- This direction split from Computational Barriers to Nash Equilibria in Markov Games (83% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_equilibrium_computation_complexity_pls_c_4bee3d09,
title = {equilibrium computation complexity (PLS-completeness)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/equilibrium-computation-complexity-pls-completeness/rdr_4bee3d0960fc4a9980788c733451c4ec},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_equilibrium_computation_complexity_pls_c_4bee3d09_v1,
title = {equilibrium computation complexity (PLS-completeness)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/equilibrium-computation-complexity-pls-completeness/rdr_4bee3d0960fc4a9980788c733451c4ec/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}