- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the Fair Team Orienteering Problem. The authors propose FLOG, a graph-based reinforcement learning framework. Experiments demonstrate significant improvements.
Critical strengths
- The proposed framework considers both reward fairness and overall efficiency.
- The experimental results demonstrate substantial improvements.
Critical weaknesses
- The optimization objective is not fully consistent with the problem formulation.
- The contribution of RL is not sufficiently demonstrated.
Questions for authors
- Why does FLOG primarily optimize RFR in the experiments while the formal fTOP objective is to maximize the minimum agent reward?
- How much of the performance improvement comes from the learned policy rather than the heuristic fairness mechanisms?
2 comments
Thank you for the clarification and the new policy comparisons. I am still unsure how selecting the final solution by RFR affects performance on the stated objective of maximizing the minimum agent reward, so I am keeping my rating.
We appreciate your valuable feedback and support of our work.
To Weakness 1& Question 1:
We apologize for not clearly stating our guiding principle in the manuscript: to substantially improve the minimum agent reward with limited loss of total reward. We have clearly stated this guiding principle in the revised manuscript, including the Abstract on Page 1 and the Introduction on Page 2.
The reason for choosing min R as the formal objective: because the min R objective improves the fairness by directly improving the worst reward, and maintain the total reward by indirectly maintaining or improving other agents' rewards. This is consistent with our guiding principle as stated above. In contrast, RFR is a relative ratio that can be improved by lowering the maximum agent reward, potentially producing fair but low-reward solutions. For example, NSGA-II (Gross et al., 2025) achieves a perfect RFR (close to 1), but substantially lower min R and R, as shown in Tables 2–3 and 8–11.
The reason for using RFR in FLOG design and experiments: While our objective is to maximize the reward of the single worst-reward agent, multiple agents may be under-served during route construction, so FLOG prioritizes a group of under-rewarded agents instead of the single worst-rewarded one, as described in Sec. 4.2 on Page 5. We use RFR threshold to identify the under-rewarded agents with their rewards below $ \rho \times R_{\max} $. As an alternative, we also considered a min-reward-oriented rule, which selected the bottom ratio (e.g.30%) of agents ranked by reward. This min-reward-oriented ratio rule does not reliably identify the under-rewarded agents: the under-rewarded agent proportion may exceed or be below the ratio (e.g.30%) in different cases. In the experiments, min R is the core metric. Since RFR is used in FLOG design, as stated above, and it directly reflects fairness, we also use it as an important (but not the core ) metric in the experiments. We provide an explanation of this on Page 7.
To Weakness 2& Question 2:
To quantify the individual contributions of the learned policy and the heuristic fairness mechanisms, we have added controlled experiments in Sec. 5.5 on Page 9 and Appendix J on Page 22.
Specifically, we added three baselines: Water-filling, Round-robin, and Uniform Random selection, which retain the heuristic fairness mechanisms but replace the learned action-selection policy. The baselines are also recommended by Reviewer GYEP. FLOG outperforms the 3 baselines by 4.3%, 4.2%, and 21.7% in R; 11.9%, 11.8%, and 30.7% in min R; and 0.043, 0.044, and 0.036 in RFR, respectively, which shows that the learned policy contributes significantly to FLOG. The evaluation results are summarized in Tables 15 and 16 on Page 23. The FLOG-NoRR variant in Table 4 on Page 9 contains the learned policy but removes the residual reward recovery component of the heuristic fairness mechanisms. FLOG surpasses FLOG-NoRR by 328.0% and 323.3% in terms of R and min R. This validates the significant contribution of heuristic residual reward recovery to FLOG.
Table 15: Controlled Policy Comparisons on Synthetic Datasets.
Table 16: Controlled Policy Comparisons on Real-World Datasets at Scale ⟨10,500⟩.