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.
References
Linklings: http://www.linklings.com/
Softconf: http://www.softconf.com/
Alkan, A., Demange, G., Gale, D.: Fair allocation of indivisible goods and criteria of justice. Econometrica 59(4), 1023–1039 (1991)
Apers, P.: Acceptance rates major database conferences. http://wwwhome.cs.utwente.nl/~apers/rates.html
Bezáková, I., Dani, V.: Allocating indivisible goods. SIGecom Exch. 5(3), 11–18 (2005)
Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295–328 (2001)
Bogomolnaia, A., Moulin, H.: A simple random assignment problem with a unique solution. Econ. Theory 75(3), 257–279 (2004)
Chaudhuri, S.: Microsoft’s academic conference management service. http://cmt.research.microsoft.com/cmt/
Cook, W., Golany, B., Kress, M., Penn, M., Raviv, T.: Optimal allocation of proposals to reviewers to facilitate effective ranking. Manag. Sci. 51(4), 655–661 (2005)
Ghouilla-Houri, A.: Charactérisations des matrices totalment unimodulaires. C. R. Acad. Sci. Paris 254, 1192–1193 (1962)
Goldsmith, J., Sloan, R.H.: The AI conference assignment problem. In: Proceedings of the Workshop on Preference Handling for Artificial Intelligence (2007)
Halevi, S.: Websubrev, http://people.csail.mit.edu/shaih/websubrev/
Hartvigsen, D., Wei, J.C., Czuchlewski, R.: The conference paper-reviewer assignment problem. Decis. Sci. 30(3), 865–876 (1999)
Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. ACM Trans. Algorithms 2(4), 602–610 (2006)
Janak, S.L., Taylor, M.S., Floudas, C.A., Burka, M., Mountzizris, T.J.: Novel and effective integer optimization approach for the NSF panel-assignment problem. Ind. Eng. Chem. Res. 45(1), 258–265 (2005)
Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)
Katta, A.-K., Sethuraman, J.: A solution to the random assignment problem on the full preference domain. J. Econ. Theory 131(1), 231–250 (2005)
Kohler, E.: HotCRP. http://www.cs.ucla.edu/~kohler/hotcrp/
Lenstra, J.K., Shmoys, D.B., Tardos, É.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259–271 (1990)
Mehlhorn, K., Michail, D.: Network problems with non-polynomial weights and applications. Manuscript
Merelo-Gurvós, J.J., Castillo-Valdivieso, P.: Conference paper assignment using a combined greedy/evolutionary algorithm. In: Proceedings of Parallel Problem Solving from Nature, pp. 602–611 (2004)
Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2003)
O’Dell, R., Wattenhofer, M., Wattenhofer, R.: The paper assignment problem. Technical Report 491, ETH Zürich (2005)
Shiloach, Y.: Another look at the degree constrained subgraph problem. Inf. Process. Lett. 12(2), 89–92 (1981)
Shmoys, D.B., Tardos, É.: An approximation algorithm for the generalized assignment problem. Math. Program. 62, 461–474 (1993)
Svensson, L.-G.: Strategy-proof allocation of indivisible goods. Social Welf. Choice 16(4), 557–567 (1999)
Tungodden, B.: Egalitarianism: Is leximin the only option? Econ. Philos. 16, 229–245 (2000)
Voronkov, A.: Personal communication
Voronkov, A.: Easychair. http://www.easychair.org
Voronkov, A.: Easychair—users. http://www.easychair.org/users.cgi
Wang, F., Chen, B., Miao, Z.: A survey on reviewer assignment problem. In: Proceedings of the 21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, pp. 718–727 (2008)
Zhou, L.: On a conjecture by Gale about one-sided matching problems. J. Econ. Theory 52(1), 123–135 (1990)
Author information
Authors and Affiliations
Corresponding author
Additional information
J. Mestre’s research is supported by an Alexander von Humboldt Fellowship.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Garg, N., Kavitha, T., Kumar, A. et al. Assigning Papers to Referees. Algorithmica 58, 119–136 (2010). https://doi.org/10.1007/s00453-009-9386-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-009-9386-0
Keywords
- Fair assignment
- Rank-maximal matchings
- Leximin principle