Atmaca, AbdullahOruç, A. Yavuz2016-02-082016-02-0820101062-922Xhttp://hdl.handle.net/11693/28433Date of Conference: 10-13 Oct. 2010In many assignment problems, a set of documents such as research proposals, promotion dossiers, resumes of job applicants is assigned to a set of experts for ordinal evaluation, ranking, and classification. A desirable condition for such assignments is that every pair of documents is compared and ordered by one or more experts. This condition was modeled as an optimization problem and the number of pairs of documents was maximized for a given incidence relation between a set of documents and a set of experts using a set covering integer programming method in the literature[5]. In this paper, we use a combinatorial approach to derive lower bounds on the number of experts needed to compare all pairs of documents and describe assignments that asymptotically match these bounds. These results are not only theoretically interesting but also have practical implications in obtaining optimal assignments without using complex optimization techniques. ©2010 IEEE.EnglishAssignment problemsCombinatorial assignmentDocument evaluationOrdinal rankingPeer reviewAssignment problemsCombinatorial assignmentDocument evaluationOrdinal rankingPeer reviewCyberneticsInteger programmingOptimizationTracking (position)Information retrieval systemsConference Paper10.1109/ICSMC.2010.5642315