pith. sign in

arxiv: 2505.24239 · v1 · pith:HYAXQPJFnew · submitted 2025-05-30 · 💻 cs.MA · cs.AI· cs.CL· cs.LG

An Adversary-Resistant Multi-Agent LLM System via Credibility Scoring

classification 💻 cs.MA cs.AIcs.CLcs.LG
keywords credibilitymulti-agentsystemadversarialadversary-resistantagentsscoringsettings
0
0 comments X
read the original abstract

While multi-agent LLM systems show strong capabilities in various domains, they are highly vulnerable to adversarial and low-performing agents. To resolve this issue, in this paper, we introduce a general and adversary-resistant multi-agent LLM framework based on credibility scoring. We model the collaborative query-answering process as an iterative game, where the agents communicate and contribute to a final system output. Our system associates a credibility score that is used when aggregating the team outputs. The credibility scores are learned gradually based on the past contributions of each agent in query answering. Our experiments across multiple tasks and settings demonstrate our system's effectiveness in mitigating adversarial influence and enhancing the resilience of multi-agent cooperation, even in the adversary-majority settings.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Capability Advertisement as a Market for Lemons: A Trust Layer for Heterogeneous Agent Networks

    cs.MA 2026-06 unverdicted novelty 6.0

    Proposes a Trust Layer on top of existing agent protocols that adds probabilistic capability descriptors, screening, and reputation to enable separating equilibria and bound delegation reliability.

  2. Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems

    cs.CL 2026-05 unverdicted novelty 6.0

    Nexa learns a response-conditioned policy that starts with parallel agent execution and adds at most one round of sequential message passing via a predicted sparse DAG, strictly subsuming pure parallel mode.