- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper focus on the credit assignment problem in spatial multi-agent reinforcement learning. It uses entropy-regularized optimal transport to derive assignments from geometric costs and generate individual reward signals. Experiments show improvements on coverage and navigation tasks, while benefits are limited in more complex settings.
Critical strengths
-
It provides a simple reward-shaping mechanism that derives agent-specific rewards from optimal transport over geometric costs.
-
It shows performance improvements in the main MPE and VMAS experiments, supporting its effectiveness in spatial coverage and navigation tasks.
Critical weaknesses
-
The scope is relatively narrow, and the overall novelty appears limited. Basically SRC formulates geometric costs(reward) as an entropy-regularized optimal transport problem, solves it using Sinkhorn iterations to construct several types of rewards. The contribution beyond combining these established components is not sufficiently demonstrated. Moreover, its effectiveness depends on the task property (geometric proximity), which may not hold in all tasks. This is also reflected in the experiments, where clear gains are concentrated in coverage and navigation tasks.
-
The use of Sinkhorn is not well justified. Why ot is needed? It is unclear why Sinkhorn-based soft assignment is preferable to simpler alternatives, such as nearest-target heuristics or Hungarian-based hard assignment. I would not be surprised if that these alternatives would perform worse, but evaluating them would strengthen the rationale for the design and validate the proposed mechanism.
-
The positive evidence mainly comes from spatial coverage and navigation tasks. The lack of consistent gains on more complex tasks, like GRF or SMAC. The broader use of the method is uncertain.
Questions for authors
See above
Thank you for the detailed response and additional experiments. The new comparisons with simpler assignment methods and the credit delivery controls address much of my concern about the experimental validation. In particular, the results provide useful evidence that agent-specific credit delivery is beneficial.
However, my main concern about the limited novelty remains. The new results do not establish a clear advantage of Sinkhorn over simpler alternatives such as Hungarian matching, and the effectiveness is still largely limited to spatial tasks. While I appreciate the more careful positioning of the contribution, I will maintain my original score.