Training LLMs for Multi-Agent Collaboration with Verifiable Information Rewards
Authors: Keru Chen, Sen Lin, Yingbin Liang, Nathaniel D. Bastian, Shaofeng Zou
Organizations: School of ECEE, Arizona State University · Computer Science Department, University of Houston · Department of ECE, The Ohio State University · Whiting School of Engineering, Johns Hopkins University
Effective collaboration among large language model (LLM) agents in multi-agent systems requires sharing relevant evidence, requesting missing information, and incorporating teammates' contributions into decisions. Training these behaviors is challenging because final task outcomes provide limited feedback on the value of individual messages. We introduce CoSIR (Collaboration via Surprisal-based Information Rewards), a post-training approach that uses a simple, verifiable environment to teach collaboration behaviors that generalize to more complex, unseen tasks. We propose a Bayesian evaluator that scores shared information by its reduction in team surprisal, defined as the sum of the negative log probabilities assigned to the correct option given each agent's available evidence. Requests are scored by the potential reduction in the same quantity if the requested information were truthfully provided. Separate rewards encourage agents to use the received information in their private choices and calculations. We post-train Qwen3-4B, Qwen3-8B, and Gemma-3-4B-it through self-play and evaluate transfer to seven unseen natural-language collaboration tasks. CoSIR achieves the highest aggregate score, while its performance in general tasks remains competitive. Behavioral analyses show increased disclosure of private evidence and fewer judged failures to use teammates' input.
Figures & tables
Figure 1: Overview of CoSIR. Agents receive different parts of a rating table and exchange messages before choosing an option. A Bayesian evaluator scores shared ratings by how they change the probability of the correct option and scores requests by the potential value of a truthful answer. Private-answer rewards assess option choices and calculations using the ratings available to each agent. Self-play updates a policy shared by all agents, which is then evaluated on seven unseen collaboration tasks. The table and briefings illustrate one training instance.
Unseen collaboration tasks: mean ± std
Overall transfer
Method
Hidden Bench
SILO
SplitQA
MathChat
Bench Form
Einstein
Collab. Tax
SUM
Δ SUM
Qwen3-8B
Base
64.23±3.85
63.53±3.56
57.50±6.32
78.48±1.97
49.80±0.99
3.58±0.69
35.48±7.44
352.60
0.00
ToM
68.85±4.24
71.70±3.99
56.43±1.84
73.95±0.20
51.05±3.89
5.42±0.17
26.78±2.92
354.17
+1.57
TalkHier
65.38±5.25
68.63±1.60
53.93±0.71
81.96±2.70
56.80±5.37
2.50±0.33
35.45±1.14
364.65
+12.06
Outcome-RL
67.31±4.76
68.25±3.54
57.50±2.95
79.55±3.61
51.80±1.98
4.33±1.09
34.98±3.92
363.72
+11.12
Table 1: Transfer to seven unseen collaboration tasks. Task scores (%) show mean ± standard deviation. SUM is the sum of seven task scores, each measured on a 0–100 scale. Δ SUM is the change from Base for the same model. Shading marks CoSIR. Bold marks the best score within each model, including ties. SILO denotes SILO-BENCH and Collab. Tax denotes Collaboration Tax.
Task
Behavior
Qwen3-8B
Qwen3-4B
Gemma-3-4B-it
HiddenBench
Private facts disclosed ↑
68.5 → 74.3
24.5 → 33.9
9.9 → 15.3
Messages responding to teammates ↑
59.4 → 65.8
64.0 → 73.4
93.1 → 95.4
SILO-BENCH
Agents listing all own data ↑
55.3 → 65.4
74.8 → 78.4
76.8 → 85.9
Result-only messages ↓
16.2 → 12.8
10.2 → 8.1
10.6 → 9.3
SplitQA
Holders stating supporting facts ↑
52.9 → 58.2
56.8 → 62.9
33.6 → 35.7
MathChat
Messages with correction language ↑
2.5 → 11.1
4.9 → 6.2
40.1 → 44.4
Table 2: Observed collaboration behaviors (%). Each pair reads Base → CoSIR . Arrows beside the measures indicate the intended direction. Disclosure measures cover any discussion round. Correction language records attempts to correct an error, without judging whether the correction succeeds. Appendix J defines the denominators.
Failure type
Base
CoSIR
Specification and system design
88.2
88.3
Disobey task specification
5.6
6.1
Disobey role specification
0.0
0.0
Repeated steps
85.1
85.6
Loss of conversation history
9.5
9.8
Unaware of when to stop
18.5
22.4
Table 3: MAST failures (%) pooled across three models on HiddenBench, SplitQA, and MathChat ( Cemri et al., 2025 ) . Shaded rows give category totals, and bold marks the lower value. The final row gives the mean count of failure types. Appendix K defines the aggregation.
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
Family
Weight
Agents
Private ratings
Shared
Holders shown
Rounds
A
30%
4
Usually one cell per agent
3–5
No
3–6
B
15%
2
Usually two cells per agent
3–5
No
3–5
C
20%
4
Portions of sizes (8,4,4,4)
0
No
3–6
D
15%
2
(6,6) , (7,5) , or (8,4) cells
4
Yes
4–8
E
20%
3
(5,5,5) , (7,5,3) , or (6,6,2) cells
4
No
4–8
Appendix
Table 4: Information configurations. Parenthesized counts give the ratings allocated across agents. The number of discussion rounds is sampled uniformly within each listed range.
Setting
Value
Games per collection round
60
Policy messages per speaking state
16
Policy answers per answer state
8
Additional demonstrations per group
0–2
Policy sampling temperature
1.2
Generated message limit
1,024 tokens
Appendix
Table 5: Common sampling and optimization settings. A collection round means generating fresh games and then training on their candidate responses.
Backbone
Round 1
Round 2
Round 3
Qwen3-8B
1×10−5
1×10−5
2×10−5
Qwen3-4B
1×10−5
1×10−5
2×10−5
Gemma-3-4B-it
1×10−5
1×10−5
2×10−5
Appendix
Table 6: Learning rates for the three collection rounds. Each rate is fixed within its round.
Task
Response stage
Temperature
Token limit
Thinking
HiddenBench
Discussion
0.7
320
Off
Final answer
0
10,240
On
SILO-BENCH
Discussion
0.7
320
Off
Final answer
0
6,144
On
SplitQA
Discussion
0.7
320
Off
Final answer
0
6,144
On
Appendix
Table 7: Generation settings for the seven unseen collaboration tasks. The first three tasks use separate settings for discussion and final answers. SILO-BENCH permits one further answer attempt with thinking disabled when needed, as described in the text.
Model
Policy
GSM8K
MMLU
IFEval
Qwen3-8B
Base
93.9
77.6
84.4
CoSIR
93.7
77.8
84.1
Qwen3-4B
Base
93.3
75.3
81.5
CoSIR
93.1
74.7
81.8
Gemma-3-4B-it
Base
88.9
63.5
75.1
CoSIR
89.7
63.8
75.0
Appendix
Table 8: General-capability scores (%) before and after collaboration training.
Large Language Models (LLMs) in multi-agent systems (MAS) have shown promise for complex tasks, yet current training methods lack principled ways to connect system-level evaluation with agent- and message-level learning. We propose a theoretical framework that unifies cooperative game-theoretic attribution with process reward modeling to transform system evaluation to agent credit to response-level signals. Unlike prior approaches that rely only on attribution (Shapley) or step-level labels (PRM), our method produces local, signed, and credit-conserving signals. In success cases, Shapley-based credit assignment fairly allocates outcomes across agents and is refined into per-message rewards that promote cooperation while discouraging redundancy or sabotage; in failure cases, first-error localization yields repair-aware preferences that penalize harmful steps while rewarding corrective attempts. The resulting signals are bounded, cooperative, and directly compatible with reinforcement- or preference-based post-training, providing a unified and auditable pathway from global evaluation to local supervision in LLM multi-agent training. Our contribution is conceptual: we present a theoretical foundation and training signals, leaving empirical validation for future work.
Chih-Hsuan, Yang, Tanwi Mallick +5
Bella · Argonne National Laboratory · & University of Chicago
Large language model (LLM) agents increasingly coordinate in multi-agent systems, yet we lack an understanding of where and why cooperation fails. Many real-world coordination problems are not social dilemmas: helping others -- sharing documentation, unblocking a teammate -- costs the helper almost nothing while producing substantial collective benefit. Whether LLM agents cooperate in this regime, where helping is free and they are explicitly instructed to do so, remains unknown. We build a turn-based multi-agent environment that strips away all strategic complexity, making cooperation costless and trivially optimal. Across eight widely used LLMs, capability does not predict cooperation: OpenAI o3 reaches only 17% of optimal collective performance while the weaker o3-mini reaches 50%, despite identical instructions to maximize group revenue. Using a causal decomposition that automates one side of agent communication, we separate cooperation failures from competence failures, and find that several capable models actively withhold information despite gaining nothing from withholding. Targeted interventions address each mode: explicit protocols roughly double the performance of competence-limited models, while small sharing incentives unlock cooperation-limited ones. Our results suggest that scaling intelligence alone will not solve coordination in multi-agent systems, and will require deliberate cooperative design, even when helping costs nothing.
Advait Yadav, Sid Black, Oliver Sourbut
MATS · University of Illinois Urbana-Champaign · UK AI Security Institute +1
LLM-based multi-agent collaboration is increasingly used to solve complex tasks by dividing work among specialized agents and integrating complementary expertise. Yet existing systems and evaluations largely rest on an implicit perfect-colleague assumption: collaborators provide correct and complete information and respond promptly to requests. In realistic teamwork, however, collaborators may return information that does not answer the intended question, provide insufficient detail to support a decision, or fail to respond to a request. To separate task-solving competence from the ability to recover an unreliable evidence-gathering process, we introduce the Unreliable Colleagues Benchmark (UnCoBench), which organizes behavioral failures through Misaligned, Incomplete, and Missed settings. The main agent need to verify contextual correctness, diagnose information gap and track unresolved dependencies in order to obtain the correct evidence for solving the task. We also introduce a verifiable and scalable automated generation pipeline that pairs LLM-based scenario generation with executable checks of answer uniqueness and role necessity. Results across ten models show that similar reliable-setting performance can result in different robustness to unreliable evidence. Trace analysis reveals frequent omissions of corrective follow-up, and the recovery behavior involves inefficient waiting and redundant queries. These findings show that robust collaboration requires not only sound reasoning, but also targeted action to diagnose evidence failures, recover relevant information, and integrate it into decisions. Our data and source code are available at https://github.com/iNLP-Lab/UnCoBench.