- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes MeanMAC, which combines one-step MeanFlow policies with team Q-learning for offline multi-agent coordination. Each agent generates actions from its local observation, identity, and noise, while additive team-value learning and joint-action candidate selection guide policy optimization without iterative sampling or teacher–student distillation. Experiments are conducted on MA-MuJoCo, MPE, and SMACv1.
Critical strengths
- The method is clearly structured.
- The experiments are extensive and cover both continuous and discrete action tasks.
Critical weaknesses
- No code is provided.
- The novelty is relatively limited. MeanFlowQL[1] and OM2P[2] have already combined MeanFlow with Q-learning. The main additions are additive team-value learning and joint-action candidate selection.
Questions for authors
- MeanMAC uses VDN-style additive value decomposition. Have the authors considered alternatives, such as QMIX-style nonlinear mixing or directly modeling a joint Q-function? Does the w/o IGM ablation include either approach?
- OM2P[2] already combines MeanFlow with Q-value guidance for offline MARL. Could the authors clarify the differences between MeanMAC and OM2P and provide experimental comparisons to demonstrate the benefit of these differences?
- Have the authors considered other one-step generators, such as Shortcut models[3]? Please explain why MeanFlow was chosen, how it differs from Shortcut models in these tasks, and ideally provide a comparison under the same settings.
- Each agent uses independent noise, so the base joint policy is a product of local policies. When multiple cooperative modes require agents to make matching choices under the same observation conditions, how does the method avoid mismatched modes across agents? Could the authors provide further analysis or experiments?
If the authors address my concerns, I will increase my score.
References [1] One-Step Generative Policies with Q-Learning: A Reformulation of MeanFlow [2] OM2P: Offline Multi-Agent Mean-Flow Policy [3] One Step Diffusion via Shortcut Models