2026-07-20T11:45:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5887 2024-03-06T10:37:05Z ddc:004 open_access

Resource Optimization for Program Committee Members: A Subreview Article Bender, Michael A. McCauley, Samuel Simon, Bertrand Singh, Shikha Vivien, Frédéric Scheduling Delegation Subreviews This paper formalizes a resource-allocation problem that is all too familiar to the seasoned program-committee member. For each submission j that the PC member has the honor of reviewing, there is a choice. The PC member can spend the time to review submission j in detail on his/her own at a cost of C_i. Alternatively, the PC member can spend the time to identify and contact peers, hoping to recruit them as subreviewers, at a cost of 1 per subreviewer. These potential subreviewers have a certain probability of rejecting each review request, and this probability increases as time goes on. Once the PC member runs out of time or unasked experts, he/she is forced to review the paper without outside assistance. This paper gives optimal solutions to several variations of the scheduling-reviewers problem. Most of the solutions from this paper are based on an iterated log function of C_i. In particular, with k rounds, the optimal solution sends the k-iterated log of C_i requests in the first round, the (k-1)-iterated log in the second round, and so forth. One of the contributions of this paper is solving this problem exactly, even when rejection probabilities may increase. Naturally, PC members must make an integral number of subreview requests. This paper gives, as an intermediate result, a linear-time algorithm to transform the artificial problem in which one can send fractional requests into the less-artificial problem in which one sends an integral number of requests. Finally, this paper considers the case where the PC member knows nothing about the probability that a potential subreviewer agrees to review the paper. This paper gives an approximation algorithm for this case, whose bounds improve as the number of rounds increases. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Michael A. Bender and Samuel McCauley and Bertrand Simon and Shikha Singh and Frédéric Vivien 2016 Is Part Of LIPIcs, Volume 49, 8th International Conference on Fun with Algorithms (FUN 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FUN.2016.7 urn:nbn:de:0030-drops-58872 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.7 eng https://creativecommons.org/licenses/by/3.0/legalcode