Fast and Scalable Multi-Agent Distribution Matching via Partitioned Optimal Transport

arXiv:2609.38960 · cs.MA, cs.RO, cs.SY, eess.SY, math.OC · Submitted 2026-09-30 · Read on arXiv

cs.MA, cs.RO, cs.SY, eess.SY, math.OC

Submitted: 2026-09-30

Updated: 2026-09-30

Terminology

• Optimal Transport — 20× in this paper · explained in 5 episodes
• Distribution Matching — 18× in this paper · explained in 2 episodes
• Wasserstein Distance — 14× in this paper · explained in 4 episodes
• Multi-Agent System — 4× in this paper · explained in 6 episodes
• Sparsity — 3× in this paper · explained in 4 episodes
• 2-Wasserstein Distance — 2× in this paper · explained in 1 episode
• Clustering — 1× in this paper · explained in 2 episodes
• Convergence Guarantees — 1× in this paper · explained in 3 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Optimal Transport (OT) — 1× in this paper · explained in 4 episodes
• Steering — 1× in this paper · explained in 2 episodes

Related papers

• Highway Congestion Reduction through Reinforcement Learning Based Eulerian Headway Control
• You Only Align Once: Propagating Cooperative Behaviors in Multi-Agent Systems through Seed Agents
• Deny Without Disabling: Authorization-Paired Evaluation and Control for Multi-Agent Systems
• MA-SAPO: Multi-Agent Reasoning for Score-Aware Prompt Optimization
• PeroMAS: A Multi-agent System of Perovskite Material Discovery
• StitchCUDA: An Automated Multi-Agents End-to-End GPU Programing Framework with Rubric-based Agentic Reinforcement Learning