# PPAD (complexity)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Electronic Colloquium on Computational Complexity
- 2016

Local search proved to be an extremely useful tool when facing hard optimization problems (e.g., via the simplex algorithmâ€¦Â (More)

Is this relevant?

2014

2014

- STOC
- 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)

Is this relevant?

2013

2013

- Discrete Mathematics
- 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

- 2011

We present a single sufficient condition for the processability of the Lemke algorithm for semimonotone Linear Complementarityâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- SIAM J. Comput.
- 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

- J. ACM
- 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)

Is this relevant?

2009

2009

- WINE
- 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)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

The authors advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving twoâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- 47th Annual IEEE Symposium on Foundations ofâ€¦
- 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)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Electronic Colloquium on Computational Complexity
- 2005

In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing thatâ€¦Â (More)

Is this relevant?