- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces PRISM, an event-driven multi-agent framework for stochastic resource collection that formulates dispatch as an asynchronous multi-agent semi-Markov decision process (SMDP). The method couples a state-aware context encoder with a semi-autoregressive joint assignment decoder and an adaptive preference head that infers per-agent trade-offs over three objectives: Resource Volume, Timeliness, and Fairness. Across four public spatio-temporal graph datasets, PRISM reportedly outperforms both single-objective and multi-objective baselines on all three metrics.
Critical strengths
- I am not an expert in urban data mining, but the problem setting of asynchronous resource allocation seems relatively novel in the machine learning literature.
- Evaluations on four heterogeneous datasets with multiple runs and standard deviations reported; inclusion of multi-objective variants of strong baselines makes the comparisons more compelling than volume-only baselines.
- The code has been uploaded to an anonymous repository, enabling reproducibility.
Critical weaknesses
- First, I find it puzzling that the authors’ first contribution, reformulating MTOP as an SMDP, is relegated to the appendix. Moreover, this new problem formulation does not seem to be closely connected to the proposed method. In other words, while I can understand the need for this reformulation, I do not see a clear design rationale linking the new problem formulation to the proposed neural network components. Further, unlike previous approaches (both multi-agent problem settings), what are the distinctive features and interpretability of the proposed neural model? It reads like a stack of existing techniques.
- The positioning relative to neural combinatorial optimization is light; this could be deepened, e.g., see [1], [2], [3].
- “Arrival-time collisions” and feasibility masks are referenced but not formally specified (what constitutes a collision, how ties over arrival times/destinations are resolved, what mask logic is used). The role of “team-level objective weights” in control tokens is unclear given training uses fixed scalarization; whether these are ever varied or learned is not explicit.
- The mapping from EMS/PEMS08/METR-LA traffic signals to “resources to collect” is not fully justified; these datasets are forecasting benchmarks repurposed for dispatch, and the operational meaning of the three objectives (especially Timeliness) in these domains needs clearer grounding. Dataset-specific agent speeds are chosen ad hoc to reconcile heterogeneous distance matrices; sensitivity of results to these choices is not reported and may influence relative method behavior. Statistical significance (beyond mean±std) and robustness to reward scalarization weights are not provided; it is unclear how stable conclusions are if λs change.
References:
[1] Kim, Minsu, Junyoung Park, and Jinkyoo Park. "Sym-nco: Leveraging symmetricity for neural combinatorial optimization." Advances in Neural Information Processing Systems 35 (2022): 1936-1949.
[2] Luo, Fu, et al. "Neural combinatorial optimization with heavy decoder: Toward large scale generalization." Advances in Neural Information Processing Systems 36 (2023): 8845-8864.
[3] Drakulić, Darko, Sofia Michel, and Jean-Marc Andreoli. "GOAL: A generalist combinatorial optimization agent learner." International Conference on Learning Representations. Vol. 2025. 2025.
Questions for authors
- See the Weaknesses.
- Have you compared the constrained-first agent ordering with randomized or learned orderings? Does performance or stability change materially?
- Within an event, have you tried per-assignment advantages (e.g., reweighting by marginal contribution) instead of a single shared advantage to reduce potential intra-event credit bias?
3 comments
Thank you for the response. Part of my concerns have been addressed, and I have updated my evaluation accordingly.
Thank you for considering our responses and raising your score. We appreciate your time, constructive feedback, and engagement in the discussion.
We thank the reviewer for their detailed review and thoughtful questions.
Problem formulation. We will move the relevant problem formulation into the main text. We appreciate your bringing this matter to our attention.
Core contributions. The following table summarizes the core contributions of this paper. The problem–design connections are described in the Introduction and the opening paragraphs of the Method subsections.
Neural combinatorial optimization. We will expand the discussion of neural combinatorial optimization and include relevant references. Thank you for your addition to this part.
Collisions and feasibility.
Team objective weights. Team objective weights remain fixed and serve both as inputs to the State-Aware Context Encoder and as coefficients for computing the final reward. Section 3.1 identifies them as control-token inputs, while Appendix C.6 explicitly states: “The preference weights are used both as team-level objective weights signals in the State-Aware Context Encoder and as coefficients for computing the multi-objective reward.”
Dataset interpretation and Timeliness.
Scalarization weights. The effects of reward scalarization weights are already reported in Appendix C.6 and Table 7. The results show that varying the reward scalarization weights shifts the team's overall behavior while still maintaining coordinated multi-objective decision making.
Agent ordering. We initially explored learned ordering, but its computational overhead was prohibitive, especially with larger fleets. Compared with random ordering, constrained-first ordering has a practical rationale: it prioritizes agents with fewer feasible choices. Ordering is not a core contribution of this work, so we did not investigate it further.
Within-event credit assignment. We tested sequential per-assignment advantage decomposition using intermediate decoder contexts. It performed worse than shared event-level GAE while introducing greater complexity, as illustrated by the NYPD results below. We therefore retained the shared event-level advantage.