Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We apply existing, and develop new, zero-sum game techniques for designing polynomial-time algorithms to compute additive… 
2014
2014
The continuous flow of technological innovations, combined with the changes that occur in accounting practice is changing the… 
2013
2013
Boolean games are an expressive and natural formalism through which to investigate problems of strategic interaction in… 
2012
2012
The Internet has moved to content broadcasting and one might anticipate future evolutions of the supported applications… 
2011
2011
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher's market model under additively… 
2011
2011
Equilibrium computation in games is currently considered one of the most challenging issues in AI. In this paper, we provide… 
2007
2007
In the Fall of 2005 it was shown that finding an Ɛ-approximate mixed Nash equilibrium in a normal-form game, even with two… 
2005
2005
El presente estudio analiza la presencia del acoso en el seno de situaciones de violencia domestica. Para ello se analizo la…