Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,670,160 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Algorithmic game theory
Arrow–Debreu model
Brouwer fixed-point theorem
Complexity class
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Enhancement of Two Passive Decentralized Biological Nitrogen Removal Systems
J. Stocks
2017
Corpus ID: 54819763
v CHAPTER 1: INTRODUCTION 1 CHAPTER 2: STARTUP OF A PILOT SCALE PASSIVE NITROGEN REDUCTION SYSTEM 5 2.
2016
2016
Epithelial mechanisms in the microbial pathogenesis of periodontal disease
S. Iancu
2016
Corpus ID: 89850025
2015
2015
PPAD 2099-Introduction to Diplomacy & Security
S. A. Enein
2015
Corpus ID: 152893885
2014
2014
Perceptions of accounting professionals about the influence of information technology in their individual work process
Ricardo Adriano Antonelli
,
Lauro Brito de Almeida
,
R. Colauto
,
W. V. D. Silva
2014
Corpus ID: 56214471
The continuous flow of technological innovations, combined with the changes that occur in accounting practice is changing the…
Expand
2014
2014
Resource Buying Games
T. Harks
,
Britta Peis
Algorithmica
2014
Corpus ID: 253975763
In resource buying games a set of players jointly buys a subset of a finite resource set E\documentclass[12pt]{minimal…
Expand
2014
2014
PPAD 5199Summer semester 2014International Diplomacy & Security
S. A. Enein
2014
Corpus ID: 112012459
2013
2013
A direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games
I. Adler
,
S. Verma
arXiv.org
2013
Corpus ID: 262609958
The linear complementarity problem, LCP(q,M), is defined as follows. For given M,q find z such that q+Mz>=0, z>=0, z(q + M z)=0…
Expand
Review
2009
Review
2009
Survey of the Computational Complexity of Finding a Nash Equilibrium
Valerie Ishida
2009
Corpus ID: 17703315
For many years it was unknown whether a Nash Equilibrium of a normal form game could be found in polynomial time. The motivation…
Expand
2008
2008
Algorithms for Computing Solution Concepts in Game Theory
U. Feige
2008
Corpus ID: 18290863
These are notes for the first five lectures of the course on Algorithmic Game Theory, given (starting November 2008) in the…
Expand
2007
2007
Games on the Sperner Triangle
Kyle G. Burke
,
S. Teng
arXiv.org
2007
Corpus ID: 60115
We create a new two-player game on the Sperner Triangle based on Sperner's lemma. Our game has simple rules and several desirable…
Expand