PPAD (complexity)
   HOME





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.*. Definition PPAD is a subset of the class TFNP, the class of function problems in FNP that are guaranteed to be total. The TFNP formal definition is given as follows: :A binary relation P(''x'',''y'') is in TFNP if and only if there is a deterministic polynomial time algorithm that can determine whether P(''x'',''y'') holds given both ''x'' and ''y'', and for every ''x'', there exists a ''y'' such that P(''x'',''y'') holds. Subclasses ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Computer Science
Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, applied disciplines (including the design and implementation of Computer architecture, hardware and Software engineering, software). Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and preventing security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Programming language theory considers different ways to describe computational processes, and database theory concerns the management of re ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

NP-completeness
In computational complexity theory, NP-complete problems are the hardest of the problems to which ''solutions'' can be verified ''quickly''. Somewhat more precisely, a problem is NP-complete when: # It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no". # When the answer is "yes", this can be demonstrated through the existence of a short (polynomial length) ''solution''. # The correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions. # The problem can be used to simulate every other problem for which we can verify quickly that a solution is correct. Hence, if we could find solutions of some NP-complete problem quickly, we could quickly find the solutions of every other problem to which a given solution can be easily verified. The name "NP-complete" is short for "nondeterministic polynomial-time complete". In this name, ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Xi Chen
Xi Chen () is a computer scientist. He is a professor of computer science at Columbia University. Chen won the 2021 Gödel Prize and Fulkerson Prize for his co-authored paper "Complexity of Counting CSP with Complex Weights" with Jin-Yi Cai. Biography Chen received his B.S. and Ph.D. from Tsinghua University. He was a postdoctoral fellow at Institute for Advanced Study, Princeton University, University of Southern California, and joined the Columbia faculty in 2011. Chen's research focuses on computational complexity theory. He also received a Presburger Award from the European Association for Theoretical Computer Science in 2015 and a Sloan Research Fellowship The Sloan Research Fellowships are awarded annually by the Alfred P. Sloan Foundation since 1955 to "provide support and recognition to early-career scientists and scholars". This program is one of the oldest of its kind in the United States. ... in 2012. References Living people Tsinghua University a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Sperner's Lemma
In mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to it. It states that every Sperner coloring (described below) of a triangulation of an simplex contains a cell whose vertices all have different colors. The initial result of this kind was proved by Emanuel Sperner, in relation with proofs of invariance of domain. Sperner colorings have been used for effective computation of fixed points and in root-finding algorithms, and are applied in fair division (cake cutting) algorithms. According to the Soviet ''Mathematical Encyclopaedia'' (ed. I.M. Vinogradov), a related 1929 theorem (of Knaster, Borsuk and Mazurkiewicz) had also become known as the ''Sperner lemma'' – this point is discussed in the English translation (ed. M. Hazewinkel). It is now commonly known as the Knaster–Kuratowski–Mazurkiewicz lemma. Statement One-dimensional case In one dimension, Spern ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


SICOMP
The ''SIAM Journal on Computing'' is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published by the Society for Industrial and Applied Mathematics (SIAM). Although its official ISO abbreviation is ''SIAM J. Comput.'', its publisher and contributors frequently use the shorter abbreviation ''SICOMP''. SICOMP typically hosts the special issues of the IEEE Annual Symposium on Foundations of Computer Science (FOCS) and the Annual ACM Symposium on Theory of Computing (STOC), where about 15% of papers published in FOCS and STOC each year are invited to these special issues. For example, Volume 48 contains 11 out of 85 papers published in FOCS 2016. References External linksSIAM Journal on Computing
on



Epsilon-equilibrium
In game theory, an epsilon-equilibrium, or near-Nash equilibrium, is a strategy profile that approximately satisfies the condition of Nash equilibrium. In a Nash equilibrium, no player has an incentive to change his behavior. In an approximate Nash equilibrium, this requirement is weakened to allow the possibility that a player may have a small incentive to do something different. This may still be considered an adequate solution concept, assuming for example status quo bias. This solution concept may be preferred to Nash equilibrium due to being easier to compute, or alternatively due to the possibility that in games of more than 2 players, the probabilities involved in an exact Nash equilibrium need not be rational numbers. Definition There is more than one alternative definition. The standard definition Given a game and a real non-negative parameter \varepsilon, a strategy profile is said to be an \varepsilon-equilibrium if it is not possible for any player to gain more t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

PLS (complexity)
In computational complexity theory, Polynomial Local Search (PLS) is a complexity class that models the difficulty of finding a locally optimal solution to an optimization problem. The main characteristics of problems that lie in PLS are that the cost of a solution can be calculated in polynomial time and the neighborhood of a solution can be searched in polynomial time. Therefore it is possible to verify whether or not a solution is a local optimum in polynomial time. Furthermore, depending on the problem and the algorithm that is used for solving the problem, it might be faster to find a local optimum instead of a global optimum. Description When searching for a local optimum, there are two interesting issues to deal with: First how to find a local optimum, and second how long it takes to find a local optimum. For many local search algorithms, it is not known, whether they can find a local optimum in polynomial time or not. So to answer the question of how long it takes to find a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


CLS (complexity)
CLS may refer to: Academic fields * Critical legal studies, school of legal philosophy * Constrained least square statistical estimator * CLs method to set bounds on particle physics model parameters * The .cls file extension, used to hold LaTeX manuscripts - see LaTeX § Compatibility and converters Education *California Labor School, San Francisco, US 1942–57 *City of London School, UK * Covington Latin School, Kentucky, US *Crystal Lake South High School, Illinois, US * Chicago Law School at The University of Chicago, US *Columbia Law School at Columbia University, US *Cornell Law School at Cornell University, US * Critical Language Scholarship Program of the US State Department Societies and associations * Caribbean Labour Solidarity, based in London, UK * Chicago Linguistic Society * Chinese Language Society * Christian Legal Society * Communist League of Struggle, US, 1931-1937 Software and technology * Cable landing station, where a submarine cable comes ashore * ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Arrow–Debreu Model
In mathematical economics, the Arrow–Debreu model is a theoretical general equilibrium model. It posits that under certain economic assumptions (convex preferences, perfect competition, and demand independence), there must be a set of prices such that Aggregate supply, aggregate supplies will equal aggregate demands for every commodity in the economy. The model is central to the theory of General equilibrium, general (economic) equilibrium, and it is used as a general reference for other microeconomic models. It was proposed by Kenneth Arrow, Gérard Debreu in 1954, and Lionel W. McKenzie independently in 1954, with later improvements in 1959. The A-D model is one of the most general models of competitive economy and is a crucial part of general equilibrium theory, as it can be used to prove the existence of general equilibrium (or Walrasian equilibrium) of an economy. In general, there may be many equilibria. Arrow (1972) and Debreu (1983) were separately awarded the Nobel Me ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Brouwer Fixed-point Theorem
Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after Luitzen Egbertus Jan Brouwer, L. E. J. (Bertus) Brouwer. It states that for any continuous function f mapping a nonempty compactness, compact convex set to itself, there is a point x_0 such that f(x_0)=x_0. The simplest forms of Brouwer's theorem are for continuous functions f from a closed interval I in the real numbers to itself or from a closed Disk (mathematics), disk D to itself. A more general form than the latter is for continuous functions from a nonempty convex compact subset K of Euclidean space to itself. Among hundreds of fixed-point theorems, Brouwer's is particularly well known, due in part to its use across numerous fields of mathematics. In its original field, this result is one of the key theorems characterizing the topology of Euclidean spaces, along with the Jordan curve theorem, the hairy ball theorem, the invariance of dimension and the Borsuk–Ulam theorem. This gives it a place ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Fixed-point Computation
Fixed-point computation refers to the process of computing an exact or approximate Fixed point (mathematics), fixed point of a given function. In its most common form, the given function f satisfies the condition to the Brouwer fixed-point theorem: that is, f is continuous and maps the unit N-cube, ''d''-cube to itself. The Brouwer fixed-point theorem guarantees that f has a fixed point, but the proof is not Constructive proof, constructive. Various algorithms have been devised for computing an approximate fixed point. Such algorithms are used in economics for computing a market equilibrium, in game theory for computing a Nash equilibrium, and in dynamic system analysis. Definitions The unit interval is denoted by E := [0, 1], and the unit N-cube, ''d''-dimensional cube is denoted by E^d. A continuous function f is defined on E^d (from E^d to itself)''.'' Often, it is assumed that f is not only continuous but also Lipschitz continuous, that is, for some constant L, , f(x)-f(y), ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Nash Equilibria
In game theory, the Nash equilibrium is the most commonly used solution concept for non-cooperative games. A Nash equilibrium is a situation where no player could gain by changing their own strategy (holding all other players' strategies fixed). The idea of Nash equilibrium dates back to the time of Cournot, who in 1838 applied it to his model of competition in an oligopoly. If each player has chosen a strategy an action plan based on what has happened so far in the game and no one can increase one's own expected payoff by changing one's strategy while the other players keep theirs unchanged, then the current set of strategy choices constitutes a Nash equilibrium. If two players Alice and Bob choose strategies A and B, (A, B) is a Nash equilibrium if Alice has no other strategy available that does better than A at maximizing her payoff in response to Bob choosing B, and Bob has no other strategy available that does better than B at maximizing his payoff in response to Alice ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]