EquiMem: Calibrating Shared Memory in Multi-Agent Debate via Game-Theoretic Equilibrium

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Meng, Yuqiao, Narvekar, Sakshi Sunil, Tang, Luoxi, Vaje, Rupali Rajendra, Zhang, Yingxue, Ye, Muchao, Xi, Zhaohan
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866917477788680192
author Meng, Yuqiao
Narvekar, Sakshi Sunil
Tang, Luoxi
Vaje, Rupali Rajendra
Zhang, Yingxue
Ye, Muchao
Xi, Zhaohan
author_facet Meng, Yuqiao
Narvekar, Sakshi Sunil
Tang, Luoxi
Vaje, Rupali Rajendra
Zhang, Yingxue
Ye, Muchao
Xi, Zhaohan
contents Multi-agent debate (MAD) systems increasingly rely on shared memory to support long-horizon reasoning, but this convenience opens a critical vulnerability: a single corrupted entry can contaminate the downstream memory-augmented reasoning, and debate alone fails to filter such errors. Existing safeguards filter entries via heuristics or LLM-based validation, yet they rely on AI judgments that share the same failure modes and overlook the cross-agent dynamics of MAD. We address this gap by formulating memory updating in MAD as a zero-trust memory game, in which no agent is assumed honest and the game's equilibrium serves as an indicator of optimal memory trust. Guided by this equilibrium, we propose EquiMem, an inference-time calibration mechanism that quantifies each update algorithmically against the shared memory state, using agents' existing retrieval queries and traversal paths as evidence rather than soliciting any LLM judgment. EquiMem instantiates calibration for both embedding- and graph-based memory, and across diverse benchmarks, MAD frameworks, and memory architectures, it consistently outperforms existing safeguards, remains robust under adversarial agents, and incurs negligible inference overhead.
format Preprint
id arxiv_https___arxiv_org_abs_2605_09278
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle EquiMem: Calibrating Shared Memory in Multi-Agent Debate via Game-Theoretic Equilibrium
Meng, Yuqiao
Narvekar, Sakshi Sunil
Tang, Luoxi
Vaje, Rupali Rajendra
Zhang, Yingxue
Ye, Muchao
Xi, Zhaohan
Artificial Intelligence
Multi-agent debate (MAD) systems increasingly rely on shared memory to support long-horizon reasoning, but this convenience opens a critical vulnerability: a single corrupted entry can contaminate the downstream memory-augmented reasoning, and debate alone fails to filter such errors. Existing safeguards filter entries via heuristics or LLM-based validation, yet they rely on AI judgments that share the same failure modes and overlook the cross-agent dynamics of MAD. We address this gap by formulating memory updating in MAD as a zero-trust memory game, in which no agent is assumed honest and the game's equilibrium serves as an indicator of optimal memory trust. Guided by this equilibrium, we propose EquiMem, an inference-time calibration mechanism that quantifies each update algorithmically against the shared memory state, using agents' existing retrieval queries and traversal paths as evidence rather than soliciting any LLM judgment. EquiMem instantiates calibration for both embedding- and graph-based memory, and across diverse benchmarks, MAD frameworks, and memory architectures, it consistently outperforms existing safeguards, remains robust under adversarial agents, and incurs negligible inference overhead.
title EquiMem: Calibrating Shared Memory in Multi-Agent Debate via Game-Theoretic Equilibrium
topic Artificial Intelligence
url https://arxiv.org/abs/2605.09278