Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design
Steven Jecmen, Hanrui Zhang, Ryan Liu, Fei Fang, Vincent Conitzer,, Nihar B. Shah

TL;DR
This paper investigates how to optimally split reviewers in two-phase conference review processes and experiments, showing that random splitting performs nearly optimally in practice and providing theoretical insights into this phenomenon.
Contribution
It proves NP-hardness of the reviewer splitting problem when the set of papers needing additional review is unknown, and demonstrates the near-optimality of random reviewer splits through empirical and theoretical analysis.
Findings
Random reviewer splitting achieves near-optimal assignment similarity.
NP-hardness of the reviewer splitting problem when the additional review set is unknown.
Theoretical bounds explain when random splitting is effective.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExpert finding and Q&A systems · Advanced Bandit Algorithms Research
