Asymptotically optimal assignments in ordinal evaluations of proposals

buir.advisorAykanat, Cevdet
dc.contributor.authorAtmaca, Abdullah
dc.date.accessioned2016-01-08T18:11:31Z
dc.date.available2016-01-08T18:11:31Z
dc.date.issued2009
dc.descriptionAnkara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2009.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2009.en_US
dc.descriptionIncludes bibliographical references leaves 42-44.en_US
dc.description.abstractIn 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.provenanceMade available in DSpace on 2016-01-08T18:11:31Z (GMT). No. of bitstreams: 1 0003928.pdf: 410707 bytes, checksum: 5a05f7fa16611e13c700063b33d9632c (MD5)en
dc.description.statementofresponsibilityAtmaca, Abdullahen_US
dc.format.extentxii, 46 leavesen_US
dc.identifier.itemidB117987
dc.identifier.urihttp://hdl.handle.net/11693/14957
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAsymptotically optimal assignmenten_US
dc.subjectPanel assignment problemen_US
dc.subjectPeer reviewen_US
dc.subjectProposal evaluationen_US
dc.subject.lccQ225.5 .A85 2009en_US
dc.subject.lcshScientific literature--Evaluation.en_US
dc.subject.lcshPeer review.en_US
dc.subject.lcshPeer review of research grant proposals--Evaluation.en_US
dc.titleAsymptotically optimal assignments in ordinal evaluations of proposalsen_US
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
0003928.pdf
Size:
401.08 KB
Format:
Adobe Portable Document Format