How to Assign Papers to Referees

摘要

We present an algorithm to distribute a possibly large number of papers among a smaller number of referees, each paper requiring k reports. The optimality criterion for the assignment is not based on a local view of each referee, but on a global performance of the whole k-assignment satisfying a fairness criterion. The algorithm is based on an iterative application of maximum weighted matching. The iterative method is only a constant factor approximation algorithm.