# Combating Collusion Rings is Hard but Possible

@inproceedings{Boehmer2021CombatingCR, title={Combating Collusion Rings is Hard but Possible}, author={Niclas Boehmer and Robert Bredereck and Andr{\'e} Nichterlein}, booktitle={AAAI Conference on Artificial Intelligence}, year={2021} }

A recent report of Littmann published in the Communications of the ACM outlines the existence and the fatal impact of collusion rings in academic peer reviewing. We introduce and analyze the problem Cycle-Free Reviewing that aims at finding a review assignment without the following kind of collusion ring: A sequence of reviewers each reviewing a paper authored by the next reviewer in the sequence (with the last reviewer reviewing a paper of the first), thus creating a review cycle where each…

## 6 Citations

### T RADEOFFS IN P REVENTING M ANIPULATION IN P APER B IDDING FOR R EVIEWER A SSIGNMENT

- Computer Science
- 2022

This paper enumerates certain desirable properties that algorithms for addressing bid manipulation should satisfy and offers a high-level analysis of various approaches along with directions for future investigation.

### Tradeoffs in Preventing Manipulation in Paper Bidding for Reviewer Assignment

- Computer ScienceArXiv
- 2022

Certain desirable properties that algorithms for addressing bid manipulation should satisfy are enumerated and a high-level analysis of various approaches to preventing this manipulation is conducted along with directions for future investigation.

### Reviewer Assignment Problem: A Systematic Review of the Literature

- BusinessJ. Artif. Intell. Res.
- 2023

Appropriate reviewer assignment significantly impacts the quality of proposal evaluation, as accurate and fair reviews are contingent on their assignment to relevant reviewers. The crucial task of…

### A Gold Standard Dataset for the Reviewer Assignment Problem

- Computer ScienceArXiv
- 2023

A novel dataset of similarity scores provided by 58 researchers who evaluated their expertise in reviewing papers they have read previously is collected and used to compare several popular algorithms employed in computer science conferences and come up with recommendations for stakeholders.

### An Overview of Challenges, Experiments, and Computational Solutions in Peer Review (Extended Version)

- Psychology
- 2022

In this overview article, we survey a number of challenges in peer review, understand these issues and tradeoﬀs involved via insightful experiments, and discuss computational solutions proposed in…

### What Factors Should Paper-Reviewer Assignments Rely On? Community Perspectives on Issues and Ideals in Conference Peer-Review

- PsychologyNAACL
- 2022

Both scientific progress and individual researcher careers depend on the quality of peer review, which in turn depends on paper-reviewer matching. Surprisingly, this problem has been mostly…

## 19 References

### On Strategyproof Conference Peer Review

- Computer ScienceIJCAI
- 2019

This work presents and analyzes an algorithm for reviewer-assignment and aggregation that guarantees strategyproofness and a natural efficiency property called unanimity, when the authorship graph satisfies a simple property.

### Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments

- Computer ScienceNeurIPS
- 2020

A (randomized) algorithm for reviewer assignment is presented that can optimally solve the reviewer-assignment problem under any given constraints on the probability of assignment for any reviewer-paper pair.

### PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review

- Computer ScienceALT
- 2019

A fairness objective is to maximize the review quality of the most disadvantaged paper, in contrast to the commonly used objective of maximizing the total quality over all papers, and an assignment algorithm based on an incremental max-flow procedure is designed that is near-optimally fair.

### On Good and Fair Paper-Reviewer Assignment

- Computer Science2013 IEEE 13th International Conference on Data Mining
- 2013

This paper performs a detailed study on conflict-of-interest (COI) types and discusses several issues related to using COI, which, it is hoped, can raise some open discussions among researchers on the COI study.

### K-Loop Free Assignment in Conference Review Systems

- Business2018 International Conference on Computing, Networking and Communications (ICNC)
- 2018

Two algorithms are proposed for a k-loop free assignment, which ensures the loop length is no less than k and assigns reviewers to maximize the summation of suitability scores, temporarily ignoring the k- loop free constraint.

### KDD 2021 Tutorial on Systemic Challenges and Solutions on Bias and Unfairness in Peer Review

- Computer ScienceKDD
- 2021

In this tutorial, a number of key challenges in peer review are discussed, several directions of research on this topic are outlined, and important open problems that are likely to be exciting to the community are highlighted.

### Paper Matching with Local Fairness Constraints

- Computer ScienceKDD
- 2019

This paper introduces two new algorithms, FairIR and FairFlow, for computing fair matchings that approximately optimize the new formulation of paper matching that achieves higher objective scores, FairFlow achieves competitive fairness, and both are capable of more evenly allocating reviewers.

### Assigning Papers to Referees

- Computer ScienceAlgorithmica
- 2009

Experimental results strongly suggest that the assignments computed by the algorithms are considerably better than those computed by popular conference management software.

### Peer Reviewing in Participatory Guarantee Systems: Modelisation and Algorithmic Aspects

- Computer ScienceAAMAS
- 2020

A mathematical model of this peer assignment task is proposed that can express diverse local PGS situations, as well as possible extensions, and an encoding of the model is developed in Answer Set Programming and used to solve realistic scenarios of PGS.

### The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods

- Economics, Computer ScienceAAAI
- 2018

This work uses order weighted averages (OWAs), a parameterized class of mean aggregators, to propose a novel and flexible class of algorithms for the assignment problem and shows an algorithm for finding an SUM-OWA assignment in polynomial time, in contrast to the NP-hardness of finding an egalitarian assignment.