arXiv (All)
open access
Fast and Scalable Multi-Agent Distribution Matching via Partitioned Optimal Transport
This paper presents a scalable optimal-transport-based framework for terminal distribution matching in multi-agent systems. While optimal transport provides a natural way to measure distributional mismatch and assign agents to a desired spatial distribution, global discrete transport can become comp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning in multi-agent systems#270915
- Multiagent negotiation for fair and unbiased resource allocation#499558
- Optimally Selecting Representative Agents from a Metric Space#793320
- Optimally Selecting Representative Agents from a Metric Space#789316
- A preference-articulated estimation of distribution algorithm for expensive multi-objective discrete optimization#428282
Record · ID 1143927
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive