Abstract
This paper formalizes a resourceallocation problem that is all too familiar to the seasoned programcommittee 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 schedulingreviewers 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 kiterated log of C_i requests in the first round, the (k1)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 lineartime algorithm to transform the artificial problem in which one can send fractional requests into the lessartificial 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.
BibTeX  Entry
@InProceedings{bender_et_al:LIPIcs:2016:5887,
author = {Michael A. Bender and Samuel McCauley and Bertrand Simon and Shikha Singh and Fr{\'e}d{\'e}ric Vivien},
title = {{Resource Optimization for Program Committee Members: A Subreview Article}},
booktitle = {8th International Conference on Fun with Algorithms (FUN 2016)},
pages = {7:17:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770057},
ISSN = {18688969},
year = {2016},
volume = {49},
editor = {Erik D. Demaine and Fabrizio Grandoni},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5887},
URN = {urn:nbn:de:0030drops58872},
doi = {10.4230/LIPIcs.FUN.2016.7},
annote = {Keywords: Scheduling, Delegation, Subreviews}
}
Keywords: 

Scheduling, Delegation, Subreviews 
Collection: 

8th International Conference on Fun with Algorithms (FUN 2016) 
Issue Date: 

2016 
Date of publication: 

02.06.2016 