Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
PPAD
Description:
A complexity class of total search problems whose solutions are guaranteed by parity arguments in directed graphs.
Primary topic:
Complexity and Algorithms in Graphs (42%)
Related topics:
Complexity and Algorithms in Graphs (42%),
Game Theory and Applications (21%),
Oral microbiology and periodontitis research (10%)
Wikidata ID:
wiki/Q7120085
OpenAlex ID:
keywords/ppad
Settling the Complexity of Two-Player Nash Equilibrium
2006
·
Xi Chen
, Xiaotie Deng
·
Annual Symposium on Foundations of Computer Science
·
614
The complexity of computing a Nash equilibrium
2006
·
Constantinos Daskalakis
, Paul W. Goldberg
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
584
The complexity of computing a Nash equilibrium
2009
·
Constantinos Daskalakis
, Paul W. Goldberg
, et al.
·
Communications of the ACM
·
430
On the Complexity of Nash Equilibria and Other Fixed Points
2010
·
Kousha Etessami
, Mihalis Yannakakis
·
SIAM Journal on Computing
·
360
Heightened immune response to autocitrullinated Porphyromonas gingivalis peptidylarginine deiminase: a potential mechanism for breaching immunologic tolerance in rheumatoid arthritis
2013
·
Anne-Marie Quirke
, Elena Birgitta Lugli
, et al.
·
Annals of the Rheumatic Diseases
·
238
PDF
Computing Nash Equilibria: Approximation and Smoothed Complexity
2006
·
Xi Chen
, Xiaotie Deng
, et al.
·
Annual Symposium on Foundations of Computer Science
·
213
PDF
Settling the Complexity of Computing Approximate Two-Player Nash Equilibria
2016
·
Aviad Rubinstein
·
ACM SIGecom Exchanges
·
194
PDF
Market equilibrium under separable, piecewise-linear, concave utilities
2011
·
Vijay V. Vazirani
, Mihalis Yannakakis
·
Journal of the ACM
·
171
Three-Player Games Are Hard
2005
·
Constantinos Daskalakis
, Christos H. Papadimitriou
·
Electronic colloquium on computational complexity
·
171
Continuous Local Search
2011
·
Constantinos Daskalakis
, Christos Papadimitriou
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
164
PDF
The Complexity of Finding Nash Equilibria
2007
·
Christos H. Papadimitriou
·
Algorithmic Game Theory
·
137
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
2004
·
R. Savani
, B. von Stengel
·
Annual Symposium on Foundations of Computer Science
·
131
On the Cryptographic Hardness of Finding a Nash Equilibrium
2015
·
Nir Bitansky
, Omer Paneth
, et al.
·
Annual Symposium on Foundations of Computer Science
·
128
Defining the role of Porphyromonas gingivalis peptidylarginine deiminase (PPAD) in rheumatoid arthritis through the study of PPAD biology
2014
·
Maximilian F Konig
, Alizay S Paracha
, et al.
·
Annals of the Rheumatic Diseases
·
120
Structure and mechanism of a bacterial host-protein citrullinating virulence factor, Porphyromonas gingivalis peptidylarginine deiminase
2015
·
Theodoros Goulas
, Danuta Mizgalska
, et al.
·
Scientific Reports
·
118
PDF
Inapproximability of Nash Equilibrium
2015
·
Aviad Rubinstein
·
ACM Symposium on Theory of Computing (STOC)
·
107
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
2022
·
John Fearnley
, Paul Goldberg
, et al.
·
Journal of the ACM
·
99
PDF
On oblivious PTAS's for nash equilibrium
2009
·
Constantinos Daskalakis
, Christos H. Papadimitriou
·
ACM Symposium on Theory of Computing (STOC)
·
98
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
2007
·
Kousha Etessami
, Mihalis Yannakakis
·
Annual Symposium on Foundations of Computer Science
·
96
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
2016
·
Sanjam Garg
, Omkant Pandey
, et al.
·
Lecture notes in computer science
·
94
The myth of the Folk Theorem
2008
·
Christian Borgs
, Jennifer Chayes
, et al.
·
Games and Economic Behavior
·
93
PDF
Extracellular Proteome and Citrullinome of the Oral Pathogen Porphyromonas gingivalis
2016
·
Tim Stobernack
, Corinna Glasner
, et al.
·
Journal of Proteome Research
·
78
Can Almost Everybody be Almost Happy?
2016
·
Yakov Babichenko
, Christos Papadimitriou
, et al.
·
Conference on Innovations in Theoretical Computer Science
·
61
The complexity of gradient descent: CLS = PPAD ∩ PLS
2021
·
John Fearnley
, Paul W. Goldberg
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
58
PDF
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
2017
·
Pavel Hubáček
, Eylon Yogev
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
55
Show more works
View as search
Works count:
204
Citation count:
4,905
Year
Topic
Type