EquiMem calibrates shared memory in multi-agent debate by computing a game-theoretic equilibrium from agent queries and paths, outperforming heuristics and LLM validators across benchmarks while remaining robust to adversarial agents.
Equilibrium points in n-person games.Proceedings of the national academy of sciences, 36(1):48–49
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 3polarities
background 3representative citing papers
Context-ordinal Nash equilibria are defined via social choice aggregation of ordinal preferences, shown to exist under mild conditions, with regularization, approximation, regret notions, complexity results, and learning rules developed.
Improved upper bound of Õ(ε^{-4/(3p+1)}) p-th order oracle complexity for convex-concave minimax problems via Monteiro-Svaiter acceleration, with matching lower bound Ω(ε^{-2/(3p-1)}).
Generative multi-agent systems exhibit emergent collusion and conformity behaviors that cannot be prevented by existing agent-level safeguards.
citing papers explorer
-
Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(\epsilon^{-4/(3p+1)})$ $p$th-Order Oracle Complexity
Improved upper bound of Õ(ε^{-4/(3p+1)}) p-th order oracle complexity for convex-concave minimax problems via Monteiro-Svaiter acceleration, with matching lower bound Ω(ε^{-2/(3p-1)}).