Pure-circuit: Strong inapproximability for PPAD
The current state-of-the-art methods for showing inapproximability in PPAD arise from the ε-
Generalized-Circuit (ε-GCIRCUIT) problem. Rubinstein (2018) showed that there exists a …
Generalized-Circuit (ε-GCIRCUIT) problem. Rubinstein (2018) showed that there exists a …
Pure-circuit: Tight inapproximability for PPAD
The current state-of-the-art methods for showing inapproximability in PPAD arise from the ɛ-
Generalized-Circuit (ɛ-GCircuit) problem. Rubinstein (2018) showed that there exists a …
Generalized-Circuit (ɛ-GCircuit) problem. Rubinstein (2018) showed that there exists a …
Empirical Policy Optimization for n-Player Markov Games
In single-agent Markov decision processes, an agent can optimize its policy based on the
interaction with the environment. In multiplayer Markov games (MGs), however, the …
interaction with the environment. In multiplayer Markov games (MGs), however, the …
Tight inapproximability for graphical games
We provide a complete characterization for the computational complexity of finding
approximate equilibria in two-action graphical games. We consider the two most well …
approximate equilibria in two-action graphical games. We consider the two most well …
[HTML][HTML] PPAD-complete approximate pure Nash equilibria in Lipschitz games
PW Goldberg, M Katzman - Theoretical Computer Science, 2023 - Elsevier
Lipschitz games, in which there is a limit λ (the Lipschitz value of the game) on how much a
player's payoffs may change when some other player deviates, were introduced about 10 …
player's payoffs may change when some other player deviates, were introduced about 10 …
PPAD-complete pure approximate Nash equilibria in Lipschitz games
PW Goldberg, M Katzman - International Symposium on Algorithmic Game …, 2022 - Springer
Lipschitz games, in which there is a limit λ (the Lipschitz value of the game) on how much a
player's payoffs may change when some other player deviates, were introduced about 10 …
player's payoffs may change when some other player deviates, were introduced about 10 …
Playing Coopetitive Polymatrix Games with Small Manipulation Cost
S Mahesh, N Bishop, LC Dinh, L Tran-Thanh - arXiv preprint arXiv …, 2021 - arxiv.org
Iterated coopetitive games capture the situation when one must efficiently balance between
cooperation and competition with the other agents over time in order to win the game (eg, to …
cooperation and competition with the other agents over time in order to win the game (eg, to …