dc.contributor.advisor | Aykanat, Cevdet | |
dc.contributor.author | Atmaca, Abdullah | |
dc.date.accessioned | 2016-01-08T18:11:31Z | |
dc.date.available | 2016-01-08T18:11:31Z | |
dc.date.issued | 2009 | |
dc.identifier.uri | http://hdl.handle.net/11693/14957 | |
dc.description | Ankara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2009. | en_US |
dc.description | Thesis (Master's) -- Bilkent University, 2009. | en_US |
dc.description | Includes bibliographical references leaves 42-44. | en_US |
dc.description.abstract | In ordinal evaluations of proposals in peer review systems, a set of proposals
is assigned to a fixed set of referees so as to maximize the number of pairwise
comparisons of proposals under certain referee capacity and proposal subject
constraints. The following two related problems are considered: (1) Assuming
that each referee has a capacity to review k out of n proposals, 2 ≤ k ≤ n,
determine the minimum number of referees needed to ensure that each pair of
proposals is reviewed by at least one referee, (2) Find an assignment that meets
the lower bound determined in (1). It is easy to see that one referee is both
necessary and sufficient when k = n, and n(n-1)/2 referees are both necessary
and sufficient when k = 2. It is shown that 6 referees are both necessary and
sufficient when k = n/2. Furthermore it is shown that 11 referees are necessary
and 12 are sufficient when k = n/3, and 18 referees are necessary and 20 referees
are sufficient when k = n/4. A more general lower bound of n(n-1)/k(k-1)
referees is also given for any k, 2 ≤ k ≤ n, and an assignment asymptotically
matching this lower bound within a factor of 2 is presented. These results are not
only theoretically interesting but they also provide practical methods for efficient
assignments of proposals to referees. | en_US |
dc.description.statementofresponsibility | Atmaca, Abdullah | en_US |
dc.format.extent | xii, 46 leaves | en_US |
dc.language.iso | English | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Asymptotically optimal assignment | en_US |
dc.subject | Panel assignment problem | en_US |
dc.subject | Peer review | en_US |
dc.subject | Proposal evaluation | en_US |
dc.subject.lcc | Q225.5 .A85 2009 | en_US |
dc.subject.lcsh | Scientific literature--Evaluation. | en_US |
dc.subject.lcsh | Peer review. | en_US |
dc.subject.lcsh | Peer review of research grant proposals--Evaluation. | en_US |
dc.title | Asymptotically optimal assignments in ordinal evaluations of proposals | en_US |
dc.type | Thesis | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.publisher | Bilkent University | en_US |
dc.description.degree | M.S. | en_US |
dc.identifier.itemid | B117987 | |