Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"PPAD"”.
-
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness
… 2019]. Using this delegation scheme, we show PPAD-hardness (and hence the hardness of computing Nash equilibria) based on the quasi-polynomial hardness of this bilinear group assumption and any hard language that is decidable in quasi-polynomial time and polynomial space. The delegation scheme …
-
The complexity of Nash equilibria in multiplayer zero-sum games and coordination games
… that three player zero-sum games are already PPAD-complete, this class of games, i.e. with pairwise separable utility functions, defines essentially the broadest class of multi-player constants sum games to which we can hope to push tractability results. Our result is obtained by establishing …
-
The complexity of continuous local search
… the complexity of some well-known problems in PPAD ∩ PLS that have resisted, in some cases for decades, attempts to put them in polynomial time. No complete problem was known for CLS, and in [9], the problems CONTRACTION, i.e., the problem of finding an approximate fixpoint of a contraction …
-
Algorithms for fair division through competitive equilibrium
… be fast in practice. The problem is known to be PPAD-hard for the case of good manna, and I also show a similar result for the case of bad manna. Given these PPAD-hardness results, designing such an algorithm is the only non-brute-force (non-enumerative) option known, e.g., the classical …
-
Structure vs. hardness through the obfuscation lens
… intersection symbol]coNP and the class PPAD that captures the complexity of computing Nash Equilibria; and -- Positive Results: We construct collision-resistant hashing from a strong form of SZK-hardness and indistinguishability obfuscation. It was previously known that …
-
Algorithms and complexity results for problems on fair division and imitation games
… NE of imitation games remains PPAD-hard, where $n$ is the number of moves available to the players. On the other hand, we design a polynomial-time algorithm to find $\epsilon$-approximate NE for any given constant $\epsilon>0$ (PTAS). The former result also rules out the smooth …
-
Multi-Player Zero-Sum Markov Games with Networked Separable Interactions
… in infinite-horizon discounted zero-sum NMGs is PPAD-hard, unless the underlying network has a “star topology”. Then, we propose fictitious-play-type dynamics, the classical learning dynamics in normal-form games, for zero-sum NMGs, and establish convergence guarantees to Markov stationary NE …
-
Parametric computation of equilibria and flows
… equilibria and show that their computation is a PPAD-complete problem. As a byproduct of our analysis, we also obtain algorithms for the parametric and non-parametric computation of equilibria in atomic splittable congestion games.
-
Succinct non-interactive arguments for bounded depth computations
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms