atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments

NeurIPS 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning · 33 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
cap each reviewer-paper assignment probability at 0.5 (randomized assignment) instead of deterministic max-similarityreviewer assignment · ICLR 2018 reconstructedsum-similarity (% of optimum): 90.8% of optimal at q0 = 0.5Mixed
add partition constraints with 15-reviewer random subsets on top of q0=0.5pairwise-constrained assignment · ICLR 2018 reconstructedsum-similarity (% of pairwise-constrained optimum): 100%No clear effect
add strict partition constraints with only 3 subsetspairwise-constrained assignment · ICLR 2018 reconstructedsum-similarity (% of non-partition objective): 99.1%Hurt
use randomized assignment with Q=0.5 instead of standard deterministic assignment against a bidding-manipulating reviewerreviewer assignment · ICLR 2018 with simulated bidsmanipulation success probability: capped at 0.5Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy