PPAD (complexity)

Known as: PPAD, PPAD complete 
In computer science, PPAD ("Polynomial Parity Arguments on Directed graphs") is a complexity class introduced by Christos Papadimitriou in 1994. PPAD… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Local search proved to be an extremely useful tool when facing hard optimization problems (e.g., via the simplex algorithm… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
The rank of a bimatrix game (A, B) is defined as rank(A + B). Computing a Nash equilibrium (NE) of a rank-0, i.e., zero-sum game… (More)
  • table 1
  • table 2
Is this relevant?
2013
2013
We show that certain polyhedral versions of Sperner’s Lemma, where the colouring is given explicitly as part of the input, are… (More)
Is this relevant?
2011
2011
We present a single sufficient condition for the processability of the Lemke algorithm for semimonotone Linear Complementarity… (More)
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Tucker’s lemma states that if we triangulate the unit disc centered at the origin and color the vertices with {1,−1, 2,−2} in an… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The authors advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Even though many people thought the problem of finding Nash equilibria is hard in general, and it has been proven so for games… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing that… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?