Pith. sign in

Who deserves the reward? sharp: Shapley credit-based optimization for multi-agent system.arXiv preprint arXiv:2602.08335, 2026b

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it
abstract

Integrating Large Language Models (LLMs) with external tools via multi-agent systems offers a promising new paradigm for decomposing and solving complex problems. However, training these systems remains notoriously difficult due to the credit assignment challenge, as it is often unclear which specific functional agent is responsible for the success or failure of decision trajectories. Existing methods typically rely on sparse or globally broadcast rewards, failing to capture individual contributions and leading to inefficient reinforcement learning. To address these limitations, we introduce the Shapley-based Hierarchical Attribution for Reinforcement Policy (SHARP), a novel framework for optimizing multi-agent reinforcement learning via precise credit attribution. SHARP effectively stabilizes training by normalizing agent-specific advantages across trajectory groups, primarily through a decomposed reward mechanism comprising a global broadcast-accuracy reward, a Shapley-based marginal-credit reward for each agent, and a tool-process reward to improve execution efficiency. Extensive experiments across various real-world benchmarks demonstrate that SHARP significantly outperforms recent state-of-the-art baselines, achieving average match improvements of 23.66% and 14.05% over single-agent and multi-agent approaches, respectively.

citation-role summary

background 1

citation-polarity summary

fields

cs.CL 2 cs.GT 1

years

2026 3

roles

background 1

polarities

background 1

representative citing papers

Coalition Free Energy and Adaptive Precision in Multi-Agent Cooperation

cs.GT · 2026-05-25 · unverdicted · novelty 6.0

The paper introduces the GT-FEP variational framework deriving a non-monotonic Shapley-value vs. precision relationship and proposes the APC adaptive algorithm that performs comparably to tuned fixed precision on real trajectory datasets without prior tuning.

citing papers explorer

Showing 3 of 3 citing papers.