3-NASH is PPAD-Complete

@article{Chen20053NASHIP,
  title={3-NASH is PPAD-Complete},
  author={Xiao Dong Chen and Xiaotie Deng},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2005}
}
In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing that 3-Nash is PPAD-complete. 

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 68 CITATIONS

Computational complexity of some intelligent computing systems

  • Int. J. Intelligent Computing and Cybernetics
  • 2011
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Complexity of Scarf ’ s Lemma and Related Problems

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Scarf is Ppad-Complete

  • ArXiv
  • 2008
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On the Approximation and Smoothed Complexity of Leontief Market Equilibria

  • Electronic Colloquium on Computational Complexity
  • 2006
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Complexity Theory, Game Theory, and Economics

  • Electronic Colloquium on Computational Complexity
  • 2018
VIEW 1 EXCERPT
CITES METHODS

FILTER CITATIONS BY YEAR

2005
2018

CITATION STATISTICS

  • 8 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES