The paper delivers a deterministic O(N) characterization of Nash equilibria in directed-cycle binary graphical games under a robust incentive structure, using parity conditions for pure equilibria and induced indifference for the mixed case.
[NBP20] Sai Ganesh Nagarajan, David Balduzzi, and Georgios Piliouras
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
representative citing papers
Proves CLS-hardness for Nash equilibrium computation in two-team polymatrix games with zero-sum or coordination pairwise payoffs, with tight CLS membership when one team has independent adversaries, plus an ε-Nash algorithm with 1/ε² runtime dependence.
Tool-using LLM agents can implement undetectable stegosystems, shifting the primary barrier to covert multi-agent collusion from technical feasibility to coordination without explicit agreement.
The authors characterize a new Borda-type social ranking solution (SRS) that satisfies weak consistency, closeness to unanimity under linear symmetric domains, neutrality, and independence of perfunctory participation.
Sublevel sets of invex functions are connected under mild assumptions, with the result extended to solution sets in invex-incave minimax problems and incave games.
citing papers explorer
-
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
Proves CLS-hardness for Nash equilibrium computation in two-team polymatrix games with zero-sum or coordination pairwise payoffs, with tight CLS membership when one team has independent adversaries, plus an ε-Nash algorithm with 1/ε² runtime dependence.