A cooperative MARL algorithm that regularizes each agent's policy toward the Sinkhorn barycenter of the team's visitation distributions, with a claimed but insufficiently proven geometric convergence guarantee.
Offline reinforcement learning with wasserstein regularization via optimal transport maps
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Wasserstein-Barycenter Consensus for Cooperative Multi-Agent Reinforcement Learning
A cooperative MARL algorithm that regularizes each agent's policy toward the Sinkhorn barycenter of the team's visitation distributions, with a claimed but insufficiently proven geometric convergence guarantee.