GraphMAS: A Systematic Benchmark of Multi-Agent Coordination for Graph Learning
Abstract
Large language model (LLM)-based multi-agent systems coordinate specialized reasoning through aggregation, interaction, and adaptive control, yet their potential for graph learning remains largely unexplored. Graph learning is a natural setting for such systems because useful evidence may arise from heterogeneous local, long-range, global structural, and semantic perspectives whose relevance varies across instances. Existing LLM-based graph learning approaches primarily rely on single-agent reasoning, while multi-agent coordination has been studied mainly in general reasoning settings. Consequently, it remains unclear whether multiple specialized agents can improve graph learning and how different coordination strategies should be designed and evaluated. To address this gap, we introduce GraphMAS, a systematic benchmark of multi-agent coordination for graph learning. GraphMAS builds a shared pool of graph reasoning specialists and organizes coordination along two dimensions, inter-agent interaction and runtime adaptivity, yielding four paradigms and seven representative coordination methods. Under a unified protocol, we evaluate these methods across seven text-attributed graphs, three domains, and two representative graph learning tasks: node classification and link prediction. Our study shows that heterogeneous graph perspectives are strongly complementary, and that coordinating specialists improves over both individual specialists and single-agent graph reasoning methods, with gains that arise from decomposing reasoning across specialists rather than from broader evidence access alone. However, richer inter-agent interaction does not reliably help, whereas instance-adaptive specialist selection yields the strongest accuracy–efficiency trade-off. We further show that the coordination policy can be learned over a fixed specialist pool and transfers to held-out graphs. GraphMAS therefore provides a controlled evaluation framework and empirical principles for understanding when and how multi-agent coordination benefits graph learning. The benchmark code is available at https://anonymous.4open.science/r/GraphMAS.
Then back it, or bet against it.
Related papers
Open the market on this paper to see 7 more related papers.