- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies the Multi-Paper Reviewer Allocation (MPRA) problem, which assigns a fixed-size reviewer group to each paper with the objective of maximizing the minimum keyword coverage across papers. The authors formulate MPRA, prove its NP-hardness, and propose HGES, an exact branch-and-bound method that dynamically uses paper demand, reviewer availability, keyword rareness, and social feasibility to guide the search. They further introduce an Index-Enhanced Search Acceleration (IESA) module to reduce repeated candidate retrieval and social-feasibility checking, and evaluate the proposed method on academic and attributed social-network datasets against heuristic and exact baselines.
Critical strengths
-
The paper studies a meaningful reviewer allocation problem by jointly considering keyword coverage, reviewer workload, and social-distance constraints.
-
The paper provides extensive experiments on multiple datasets, including comparisons with heuristic and exact baselines, ablation studies, parameter sensitivity analysis, and evaluation of the indexing component.
Critical weaknesses
-
The novelty and motivation of the studied problem are not sufficiently established. The discussion of related work is insufficient. Several existing studies already consider key ingredients of MPRA, including max-min reviewer fairness [1], multi-task team formation with coverage and workload constraints [2], and max-min allocation with conflict constraints [3]. The paper should more clearly explain what is fundamentally new in MPRA beyond combining these existing components. Second, the motivation for the max-min objective is also limited. The paper argues that aggregate objectives may disadvantage some papers, but does not explain why optimizing the worst-case coverage is preferable to average or total coverage. Since only MinCov is reported, the potential loss in overall allocation quality is unclear. Moreover, the NP-hardness result is also relatively weak. The reduction uses only one paper, so the multi-paper coupling and max-min objective disappear, and the hardness mainly comes from the social-distance constraint through Independent Set. Similar hardness results under conflict constraints already exist [3].
-
The methodological novelty of HGES is unclear. The main components of HGES, including branch-and-bound, upper/lower bounding, greedy initialization, and dynamic search ordering, have been studied in existing exact optimization methods [4,5]. The heterogeneous state mainly changes the order in which papers and reviewers are explored, while pruning still relies on standard feasibility checks and an admissible upper bound. Therefore, HGES appears more like a problem-specific combination of existing exact-search techniques. The paper should more clearly explain what new algorithmic principle is introduced beyond existing branching and ordering strategies.
[1] Stelmakh et al. PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. ALT, 2019.
[2] Vombatkere et al. Forming Coordinated Teams that Balance Task Coverage and Expert Workload. DMKD, 2025.
[3] Chiarelli et al. Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica, 2023.
[4] Sandholm et al. CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Management Science, 2005.
[5] Berktaş and Yaman. A Branch-and-Bound Algorithm for Team Formation on Social Networks. INFORMS Journal on Computing, 2021.
Questions for authors
-
Could the authors clarify the fundamental novelty of MPRA compared with prior work on max-min reviewer fairness, team formation with coverage/workload constraints, and allocation under conflict constraints? In particular, what new technical challenge arises from MPRA beyond combining these existing components?
-
Why is the max-min keyword coverage objective preferable to average or total coverage in this setting? Could the authors provide additional results showing whether improving MinCov leads to a substantial loss in overall allocation quality?
-
Since the NP-hardness reduction uses only one paper and therefore removes the multi-paper coupling and max-min structure, could the authors clarify what this hardness result reveals specifically about MPRA beyond the known hardness induced by conflict/social-distance constraints?
-
What is the main algorithmic novelty of HGES beyond standard branch-and-bound techniques such as bounding, greedy initialization, feasibility pruning, and dynamic branching/search ordering? Could the authors identify the specific new algorithmic principle introduced by the heterogeneous-state design?