PPAD (complexity)
In computer science, PPAD ("Polynomial Parity Arguments on Directed graphs") is a complexity class introduced by Christos Papadimitriou in 1994. PPAD is a subclass of TFNP based on functions that can be shown to be total by a parity argument. The class attracted significant attention in the field of algorithmic game theory because it contains the problem of computing a Nash equilibrium: this problem was shown to be complete for PPAD by Daskalakis, Goldberg and Papadimitriou with at least 3 players and later extended by Chen and Deng to 2 players.
Wikipage redirect
Algorithmic game theoryApproximate Competitive Equilibrium from Equal IncomesEconomic calculation problemEnd of the LineEnvy-free cake-cuttingFisher marketFolk theorem (game theory)Handshaking lemmaImplicit graphIndistinguishability obfuscationList of PPAD-complete problemsList of complexity classesMarket equilibrium computationPPADPPAD-hardPPAD completePPA (complexity)PPP (complexity)Simmons–Su protocolsSperner's lemmaSuccinct gameTFNP
Link from a Wikipage to another Wikipage
primaryTopic
PPAD (complexity)
In computer science, PPAD ("Polynomial Parity Arguments on Directed graphs") is a complexity class introduced by Christos Papadimitriou in 1994. PPAD is a subclass of TFNP based on functions that can be shown to be total by a parity argument. The class attracted significant attention in the field of algorithmic game theory because it contains the problem of computing a Nash equilibrium: this problem was shown to be complete for PPAD by Daskalakis, Goldberg and Papadimitriou with at least 3 players and later extended by Chen and Deng to 2 players.
has abstract
Em ciência da computação, PPAD ...... trar em mercados e muito mais.
@pt
En informatique théorique, PPA ...... plet par Chen et Deng en 2005.
@fr
In computer science, PPAD ("Po ...... by Chen and Deng to 2 players.
@en
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,023,602,851
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
Em ciência da computação, PPAD ...... , como completo para a classe.
@pt
En informatique théorique, PPA ...... plet par Chen et Deng en 2005.
@fr
In computer science, PPAD ("Po ...... by Chen and Deng to 2 players.
@en
label
PPAD (complexity)
@en
PPAD (complexité)
@fr
PPAD
@pt