# Fast Complete Algorithm for Multiplayer Nash Equilibrium

arXiv: https://arxiv.org/abs/2002.04734 · HTML: https://mlsanity.com/paper/2002.04734/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Feb 2020.

## Built on by (most cited first, 4 of 4)

- [A Survey of Decision Making in Adversarial Games](https://mlsanity.com/paper/2207.07971/) (2022)
- [Quadratic Programming Approach for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games](https://mlsanity.com/paper/2509.25618/) (2025)
- [Safe Equilibrium](https://mlsanity.com/paper/2201.04266/) (2022)
- [Fictitious Play with Maximin Initialization](https://mlsanity.com/paper/2203.10774/) (2022)

## Abstract (arXiv)

We describe a new complete algorithm for computing Nash equilibrium in multiplayer general-sum games, based on a quadratically-constrained feasibility program formulation. We demonstrate that the algorithm runs significantly faster than the prior fastest complete algorithm on several game classes previously studied and that its runtimes even outperform the best incomplete algorithms.