No article text was recorded for this version.
PPAD-completeness (computational intractability of Nash Equilibrium)
Version 1 of 1105 papers111 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Multi-Sender Persuasion: A Computational Perspective
- Blog: Coarse Correlation in Extensive-Form Games
- Blog: On the complexity of computing Markov perfect equilibrium in general-sum stochastic games
- Blog: The myth of the Folk Theorem
- Blog: Tropical Complementarity Problems and Nash Equilibria
- Blog: On the verification and computation of strong nash equilibrium
- Blog: Game-theoretic LLM: Agent Workflow for Negotiation Games
- Blog: Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games
- Blog: Approximate dynamic programming for two-player zero-sum Markov games
- Blog: From Duels to Battlefields: Computing Equilibria of Blotto and Other Games
- Blog: Incentive Stackelberg Mean-Payoff Games
- Blog: On Markov Games Played by Bayesian and Boundedly-Rational Players
- Blog: Sequential rationality in cryptographic protocols
- Blog: Competing for Resources: Estimating Adversary Strategy for Effective Plan Generation
- Blog: Computing Stackelberg Equilibria of Large General-Sum Games
- Blog: Trembling Hand Equilibria of Plurality Voting
- Blog: Decentralized No-regret Learning Algorithms for Extensive-form Correlated Equilibria (Extended Abstract)
- Blog: Algorithms for Rationalizability and CURB Sets
- Blog: Provably Efficient Reinforcement Learning in Decentralized General-Sum Markov Games
- Blog: Algorithms for Closed Under Rational Behavior (CURB) Sets
- Blog: Multi-player Equilibria Verification for Concurrent Stochastic Games
- Blog: Breaking the Curse of Multiagents in a Large State Space: RL in Markov Games with Independent Linear Function Approximation
- Blog: No-regret learning dynamics for extensive-form correlated and coarse correlated equilibria
- Blog: Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
- Blog: Imperfect-Recall Games: Equilibrium Concepts and Their Complexity
- Blog: HGMP: Heterogeneous Graph Multi-Task Prompt Learning
- Blog: α-Rank: Multi-Agent Evaluation by Evolution
- Blog: Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders
- Blog: The Complexity of Markov Equilibrium in Stochastic Games
- Blog: Computing Game-Theoretic Solutions and Applications to Security
- Blog: Approximately Gaussian Replicator Flows: Nonconvex Optimization as a Nash-Convergent Evolutionary Game
- Blog: Matching Multiple Experts: On the Exploitability of Multi-Agent Imitation Learning
- Blog: On Iterated Dominance, Matrix Elimination, and Matched Paths
- Blog: Computing Bayes-Nash Equilibria through Support Enumeration Methods in Bayesian Two-Player Strategic-Form Games
- Blog: Combining local search techniques and path following for bimatrix games
- Blog: Anytime-Constrained Equilibria in Polynomial Time
- Blog: Pure Nash Equilibria in Online Fair Division
- Blog: Solving Quadratic Multi-Leader-Follower Games by Smoothing the\n Follower's Best Response
- Blog: On the Characterization of Local Nash Equilibria in Continuous Games
- Blog: Computing Optimal Nash Equilibria in Multiplayer Games
- Blog: Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property
- Blog: An Optimization Approach for Approximate Nash Equilibria
- Blog: Extensive-Form Perfect Equilibrium Computation in Two-Player Games
- Blog: Finite-sample guarantees for Nash Q-learning with linear function approximation
- Blog: Model and Reinforcement Learning for Markov Games with Risk Preferences
- Blog: Sampling Equilibria: Fast No-Regret Learning in Structured Games
- Blog: Score-Based Equilibrium Learning in Multi-Player Finite Games with Imperfect Information
- Blog: On the Interplay between Social Welfare and Tractability of Equilibria
- Blog: Deep Reinforcement Learning for Equilibrium Computation in Multi-Stage Auctions and Contests
- Blog: How Far Are LLMs from Professional Poker Players? Revisiting Game-Theoretic Reasoning with Agentic Tool Use
- Blog: A Sharp Analysis of Model-based Reinforcement Learning with Self-Play
- Blog: The truth behind the myth of the Folk theorem
- Blog: Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex Games
- Blog: Sprague-Grundy Values of the $\mathcal{R}$-Wythoff Game
- Blog: Finding Correlated Equilibrium of Constrained Markov Game: A Primal-Dual Approach
- Blog: Semidefinite programming for N-Player Games
- Blog: A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios
- Blog: Understanding Iterative Combinatorial Auction Designs via Multi-Agent Reinforcement Learning
- Blog: The Truth Behind the Myth of the Folk Theorem
- Blog: Reinforcement Nash Equilibrium Solver
Showing 60 of 105 papers.
History & citation
Current · Permanent link
- This direction split from Computational Barriers to Nash Equilibria in Markov Games (97% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_ppad_completeness_computational_intracta_62af9f7e,
title = {PPAD-completeness (computational intractability of Nash Equilibrium)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/ppad-completeness-computational-intractability-of-nash-equilibrium/rdr_62af9f7e10ca4a769986dd416e1883a2},
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_ppad_completeness_computational_intracta_62af9f7e_v1,
title = {PPAD-completeness (computational intractability of Nash Equilibrium)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/ppad-completeness-computational-intractability-of-nash-equilibrium/rdr_62af9f7e10ca4a769986dd416e1883a2/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}