TY - GEN
T1 - K-Loop Free Assignment in Conference Review Systems
AU - Guo, Longhua
AU - Wu, Jie
AU - Chang, Wei
AU - Wu, Jun
AU - Li, Jianhua
N1 - Funding Information:
VIII. ACKNOWLEDGMENTS This work is supported in part by the National Science Foundation of China (NSFC) grants 61571300, 61401273, and 61431008. This work of the first author was done during his stay as a visitor scholar at Temple University.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/6/19
Y1 - 2018/6/19
N2 - Peer review is a common process for evaluating paper submissions and selecting high-quality papers at academic conferences. A significant task is assigning submissions to appropriate reviewers. Considering the constraints of reviewers, papers, and conflicts of interest, retrieval-based methods and assignment-based methods were proposed in previous works. However, an author could also be a reviewer in the conference. The loops between authors and reviewers may cause cooperative cheating. In this paper, two algorithms are proposed for a k-loop free assignment, which ensures the loop length is no less than k. Inspired by the existing works, the first algorithm assigns reviewers to maximize the summation of suitability scores, temporarily ignoring the k-loop free constraint. Afterward, the loops are detected and adjusted based on mergers. The second algorithm generates k-loop free assignments within the nodes that are both reviewers and authors. The other assignments are generated using linear programming. Extensive experiments show the effectiveness of the proposed methods.
AB - Peer review is a common process for evaluating paper submissions and selecting high-quality papers at academic conferences. A significant task is assigning submissions to appropriate reviewers. Considering the constraints of reviewers, papers, and conflicts of interest, retrieval-based methods and assignment-based methods were proposed in previous works. However, an author could also be a reviewer in the conference. The loops between authors and reviewers may cause cooperative cheating. In this paper, two algorithms are proposed for a k-loop free assignment, which ensures the loop length is no less than k. Inspired by the existing works, the first algorithm assigns reviewers to maximize the summation of suitability scores, temporarily ignoring the k-loop free constraint. Afterward, the loops are detected and adjusted based on mergers. The second algorithm generates k-loop free assignments within the nodes that are both reviewers and authors. The other assignments are generated using linear programming. Extensive experiments show the effectiveness of the proposed methods.
KW - loop detection
KW - Loop-free
KW - merger
KW - paper-reviewer assignment
UR - http://www.scopus.com/inward/record.url?scp=85050151976&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050151976&partnerID=8YFLogxK
U2 - 10.1109/ICCNC.2018.8390343
DO - 10.1109/ICCNC.2018.8390343
M3 - Conference contribution
AN - SCOPUS:85050151976
T3 - 2018 International Conference on Computing, Networking and Communications, ICNC 2018
SP - 542
EP - 547
BT - 2018 International Conference on Computing, Networking and Communications, ICNC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 International Conference on Computing, Networking and Communications, ICNC 2018
Y2 - 5 March 2018 through 8 March 2018
ER -