# Symmetric Policy Design for Multi-Agent Dispatch Coordination in Supply Chains

arXiv: https://arxiv.org/abs/2504.19397 · HTML: https://mlsanity.com/paper/2504.19397/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Apr 2025.

## Built on by (most cited first, 1 of 1)

- [Decentralized Multi-Agent Goal Assignment for Path Planning using Large Language Models](https://mlsanity.com/paper/2510.23824/) (2025)

## Abstract (arXiv)

We study a decentralized dispatch coordination problem in a multi-agent supply chain setting with shared logistics capacity. We propose symmetric (identical) dispatch strategies for all agents, enabling efficient coordination without centralized control. Using a common information approach, we derive a dynamic programming solution that computes optimal symmetric dispatch strategies by transforming the multi-agent problem into a tractable dynamic program on the agents common information state. Simulation results demonstrate that our method significantly reduces coordination cost compared to baseline heuristics, including belief-based strategies and an always-dispatch policy. These findings highlight the benefits of combining symmetric strategy design with a common information-based dynamic programming framework for improving multi-agent coordination performance.