DocumentCode :
3187067
Title :
Ordinal evaluation and assignment problems
Author :
Atmaca, Abdullah ; Oruç, A. Yavuz
Author_Institution :
Dept. of Comput. Sci., Bilkent Univ., Ankara, Turkey
fYear :
2010
fDate :
10-13 Oct. 2010
Firstpage :
3284
Lastpage :
3289
Abstract :
In 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.
Keywords :
combinatorial mathematics; document handling; integer programming; combinatorial approach; complex optimization techniques; document set; incidence relation; job applicants; optimal assignment problems; ordinal evaluation; set covering integer programming method; Variable speed drives; assignment problems; combinatorial assignment; document evaluation; ordinal ranking; peer review;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems Man and Cybernetics (SMC), 2010 IEEE International Conference on
Conference_Location :
Istanbul
ISSN :
1062-922X
Print_ISBN :
978-1-4244-6586-6
Type :
conf
DOI :
10.1109/ICSMC.2010.5642315
Filename :
5642315
Link To Document :
بازگشت