OpenDGO: Benchmarking Multi-Agent Organizations Across Diverse Application Domains
Abstract
Large language model (LLM)-based multi-agent systems are increasingly applied across diverse domains, yet different applications require different forms of agent organization. Existing studies typically adopt predefined organizations, such as Star, Chain, and Tree, or learn communication graphs to improve performance on specific tasks. However, these methods are largely designed and evaluated within a limited set of application domains, providing little understanding of whether an organization effective in one domain remains suitable for others with different collaboration requirements. We present OpenDGO, a controlled benchmark and analysis framework covering six real-world domains and three collaboration settings: Sequential Dependency, Parallel Decomposition, and Information Integration. Under matched tasks, agents, tools, and resource limits, OpenDGO compares fixed and learned organizations while separately examining communication graphs, role assignments, input assignments, resource budgets, and component failures. Our results show that there is no ``one-organization-for-all'' solution: preferred organizations vary across applications, and even the same communication graph can yield different outcomes under different role and input assignments. These findings highlight the need for application-dependent organization design, aiming to understand which organization is suitable for a given application, under what conditions, and why.
Figures & tables
| Category | Method | Task Quality (%) | ||||||
|---|---|---|---|---|---|---|---|---|
| Code | Fin. | Bio. | Legal | Sci. | Rec. | Avg. | ||
| (a) Sequential Dependency | ||||||||
| Single | Single Agent | 28.2 1.9 | 52.6 2.6 | 59.6 2.5 | 65.2 3.7 | 71.2 1.1 | 37.2 2.8 | 52.3 1.4 |
| Fixed | Star | 24.8 1.3 | 48.8 3.1 | 55.8 1.8 | 61.8 3.0 | 67.6 3.5 | 34.0 2.8 | 48.8 0.6 |
| Chain | 37.6 2.7 | 62.4 5.8 | 67.6 3.0 | 73.6 3.2 | 78.4 3.7 | 44.4 4.9 | 60.7 0.9 | |
| Tree | 34.2 1.7 | 60.6 3.0 | 71.2 2.1 | 77.8 2.6 | 81.2 2.7 | 50.8 3.8 | 62.6 1.4 | |
Appendix figures & tables6 assets
Supplementary material from the paper’s appendix.
Appendix
| Domain | Sequential Dependency | Parallel Decomposition | Information Integration |
|---|---|---|---|
| Coding | Locate, patch, test | Inspect files or failures separately | Reconcile issue, code, and test results |
| Finance | Extract figures, compute, verify | Inspect table and narrative separately | Combine complementary numerical facts |
| Biomedical | Retrieve, extract, verify | Review distinct articles | Resolve complementary or conflicting snippets |
| Legal | Identify issue, apply rule | Review facts, rules, exceptions | Reconcile rule, facts, and counterarguments |
| Scientific | Retrieve, classify, check rationale | Review candidate abstracts | Weigh support against refutation |
| Rec. | Profile, filter, rank | Score candidates by distinct signals | Combine history, reviews, and metadata |
| Graph | Edges | |
|---|---|---|
| Star | 5 | |
| Chain | 5 | |
| Tree | 5 | |
| Ring | 6 | |
| Mesh | all pairs | 15 |
| Community | 7 |
| Measure | Operational definition | Interpretation |
|---|---|---|
| Information coverage | at final synthesis | Required information that reaches the decision point |
| Propagation latency | First round when all designated support units reach the synthesizer; incomplete cases are censored at | Delay introduced by routing paths |
| Duplicate-message rate | Fraction of delivered messages with token-set Jaccard similarity at least to an earlier message in the run | Repetition and communication waste |
| Contradiction resolution | Source-grounded resolved conflicts divided by injected, answer-relevant conflicts | Ability to reconcile conflicting information |
| Cross-group flow | Information-bearing messages crossing the fixed community cut divided by all information-bearing messages | Exchange between specialized groups |
| Synthesizer load | Input and received-message tokens processed in the final synthesis event | Aggregation burden at the decision point |
| Organization | Active edges | Offline designer fitting | Online cost per task | Routed message tokens | Runtime state |
|---|---|---|---|---|---|
| Single Agent | – | ||||
| Star | – | ||||
| Chain | – | ||||
| Tree | – | ||||
| Ring | – | ||||
| Mesh | – |
Multi-Agent LLM Systems
Multi-agent large language model systems coordinate multiple AI agents to solve tasks through communication, specialization, shared tools, and memory.
See all 1,001 papers