Title
Paper Matching with Local Fairness Constraints.
Abstract
Automatically matching reviewers to papers is a crucial step of the peer review process for venues receiving thousands of submissions. Unfortunately, common paper matching algorithms often construct matchings suffering from two critical problems: (1) the group of reviewers assigned to a paper do not collectively possess sufficient expertise, and (2) reviewer workloads are highly skewed. In this paper, we propose a novel local fairness formulation of paper matching that directly addresses both of these issues. Since optimizing our formulation is not always tractable, we introduce two new algorithms, FairIR and FairFlow, for computing fair matchings that approximately optimize the new formulation. FairIR solves a relaxation of the local fairness formulation and then employs a rounding technique to construct a valid matching that provably maximizes the objective and only compromises on fairness with respect to reviewer loads and papers by a small constant. In contrast, FairFlow is not provably guaranteed to produce fair matchings, however it can be 2x as efficient as FairIR and an order of magnitude faster than matching algorithms that directly optimize for fairness. Empirically, we demonstrate that both FairIR and FairFlow improve fairness over standard matching algorithms on real conference data. Moreover, in comparison to state-of-the-art matching algorithms that optimize for fairness only, FairIR achieves higher objective scores, FairFlow achieves competitive fairness, and both are capable of more evenly allocating reviewers.
Year
DOI
Venue
2019
10.1145/3292500.3330899
KDD
Keywords
Field
DocType
approximation algorithms, integer programming, network flow, paper matching
Discrete mathematics,Mathematical optimization,Rounding,Mathematics
Journal
Volume
ISBN
Citations 
abs/1905.11924
978-1-4503-6201-6
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Ari Kobren1285.17
Barna Saha262637.56
Andrew Kachites McCallumzy3192031588.22