Optimal Allocation of Proposals to Reviewers to Facilitate Effective Ranking

Loading...
Thumbnail Image
Authors
Cook, Wade D.
Golany, Boaz
Kress, Moshe
Penn, Michael
Raviv, Tal
Subjects
peer review
ranking procedures
set covering
Advisors
Date of Issue
2005
Date
2005
Publisher
Language
Abstract
Peer review of research proposals and articles is an essential element in research and development processes worldwide. Here we consider a problem that, to the best of our knowledge, has not been addressed until now: how to assign subsets of proposals to reviewers where the reviewers supply their evaluations through ordinal ranking. The solution approach we propose for this assignment problem maximizes the number of proposal pairs that will be evaluated by one or more reviewers. This new approach should facilitate meaningful aggregatin of partial rankings of subsets of proposals by multiple reviewers into a consensus ranking. We offer two ways to implement the approach: an integer programming set-covering model and a heuristic procedure. The effectiveness and efficiency of the two models are tested through an extensive simulation experiment.
Type
Article
Description
Management Science, V. 51, No. 4, pp 655-661.
http://dx.doi.org/10.1287/mnsc.1040.0290
Series/Report No
Department
Operations Research (OR)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
2005 “Optimal Allocation of Proposals to Reviewers to Facilitate Effective Ranking” (with W. D. Cook, B. Golany, M. Penn and T. Raviv), Management Science, V. 51, No. 4, pp 655-661.
Distribution Statement
Rights
defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections