Assigning papers to referees

Garg, Naveen ; Kavitha, Telikepalli ; Kumar, Amit ; Mehlhorn, Kurt ; Mestre, Julian (2010) Assigning papers to referees Algorithmica, 58 (1). pp. 119-136. ISSN 0178-4617

Full text not available from this repository.

Official URL: http://link.springer.com/article/10.1007/s00453-00...

Related URL: http://dx.doi.org/10.1007/s00453-009-9386-0

Abstract

Refereed conferences require every submission to be reviewed by members of a Program Committee (PC) in charge of selecting the conference program. There are many software packages available to manage the review process. Typically, in a bidding phase PC members express their personal preferences by ranking the submissions. This information is used by the system to compute an assignment of the papers to referees (PC members). We study the problem of assigning papers to referees. We propose to optimize a number of criteria that aim at achieving fairness among referees/papers. Some of these variants can be solved optimally in polynomial time, while others are NP-hard, in which case we design approximation algorithms. Experimental results strongly suggest that the assignments computed by our algorithms are considerably better than those computed by popular conference management software.

Item Type:Article
Source:Copyright of this article belongs to Springer Verlag.
Keywords:Fair Assignment; Rank-Maximal Matchings; Leximin Principle
ID Code:101259
Deposited On:31 Jan 2018 09:09
Last Modified:31 Jan 2018 09:09

Repository Staff Only: item control page