mlsanityData to 7 Oct 2026

Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design

arXiv 2108.06371 ↗First posted 13 Aug 2021cs.AI math.OCcited by 6

Not on the map. Why?

Abstract (arXiv)

Many scientific conferences employ a two-phase paper review process, where some papers are assigned additional reviewers after the initial reviews are submitted. Many conferences also design and run experiments on their paper review process, where some papers are assigned reviewers who provide reviews under an experimental condition. In this paper, we consider the question: how should reviewers be divided between phases or conditions in order to maximize total assignment similarity? We make several contributions towards answering this question. First, we prove that when the set of papers requiring additional review is unknown, a simplified variant of this problem is NP-hard. Second, we empirically show that across several datasets pertaining to real conference data, dividing reviewers between phases/conditions uniformly at random allows an assignment that is nearly as good as the oracle optimal assignment. This uniformly random choice is practical for both the two-phase and conference experiment design settings. Third, we provide explanations of this phenomenon by providing theoretical bounds on the suboptimality of this random strategy under certain natural conditions. From these easily-interpretable conditions, we provide actionable insights to conference program chairs about whether a random reviewer split is suitable for their conference.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 15 of its 69 references that are in the map. First posted on arXiv 13 Aug 2021.

Builds on

15 of 69 references.

References · 15

  1. 2018Statistical Aspects of Wasserstein Distancescited by 202
  2. 2020Mitigating Manipulation in Peer Review via Randomized Reviewer Assignmentscited by 38
  3. 2017Design and Analysis of the NIPS 2016 Review Processcited by 33
  4. 2018PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Reviewcited by 30
  5. 2019Paper Matching with Local Fairness Constraintscited by 30
  6. 2018On Strategyproof Conference Peer Reviewcited by 16
  7. 2019On Testing for Biases in Peer Reviewcited by 15
  8. 2020Catch Me if I Can: Detecting Strategic Behaviour in Peer Assessmentcited by 14
  9. 2017Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resourcescited by 13
  10. 2016Strategyproof Peer Selection using Randomization, Partitioning, and Apportionmentcited by 12
  11. 2020Uncovering Latent Biases in Text: Method and Application to Peer Reviewcited by 11
  12. 2020A SUPER* Algorithm to Optimize Paper Bidding in Peer Reviewcited by 10
3 more
  1. 2016Online Stochastic Matching: New Algorithms and Boundscited by 7
  2. 2020A Large Scale Randomized Controlled Trial on Herding in Peer-Review Discussionscited by 6
  3. 2019Generalized Assignment via Submodular Optimization with Reserved Capacitycited by 1

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 3; 2023: 0; 2024: 0; 2025: 2.

6 papers.