Most computer science conferences rely on paper bidding to assign reviewers to papers. Although paper bidding enables high-quality assignments in days of unprecedented submission numbers, it also opens the door for dishonest reviewers to adversarially influence paper reviewing assignments. Anecdotal evidence suggests that some reviewers bid on papers by "friends" or colluding authors, even though these papers are outside their area of expertise, and recommend them for acceptance without considering the merit of the work. In this paper, we study the efficacy of such bid manipulation attacks and find that, indeed, they can jeopardize the integrity of the review process. We develop a novel approach for paper bidding and assignment that is much more robust against such attacks. We show empirically that our approach provides robustness even when dishonest reviewers collude, have full knowledge of the assignment system's internal workings, and have access to the system's inputs. In addition to being more robust, the quality of our paper review assignments is comparable to that of current, non-robust assignment approaches.
翻译:多数计算机科学会议都依靠纸质招标来指派文件审评员。 虽然在提交数量空前的几天里,纸质招标可以让高品质任务得到高质量的分配,但也为不诚实的审评员打开了对质影响纸质审查任务的大门。 传闻证据表明,有些审评员对“朋友”或串通作者的论文进行投标,尽管这些论文超出了他们的专长范围,建议他们接受这些文件,而不考虑工作的价值。 在这份文件中,我们研究了这种操纵投标袭击的功效,发现它们确实会损害审查进程的完整性。 我们为纸质投标和派任制定了一种新颖的办法来对付这种攻击,这种办法在更大程度上更加强有力。 我们从经验上表明,即使不诚实的审评员串通,充分了解任务系统的内部工作,并能够利用系统的投入,我们的做法也具有很强的强健性。 此外,我们的文件审查任务的质量与当前非野蛮派办法相当。