Show simple item record

dc.contributor.authorAtmaca, Abdullahen_US
dc.contributor.authorOruç, A. Yavuzen_US
dc.coverage.spatialIstanbul, Turkeyen_US
dc.date.accessioned2016-02-08T12:20:31Z
dc.date.available2016-02-08T12:20:31Z
dc.date.issued2010en_US
dc.identifier.issn1062-922X
dc.identifier.urihttp://hdl.handle.net/11693/28433
dc.descriptionDate of Conference: 10-13 Oct. 2010en_US
dc.description.abstractIn 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.en_US
dc.language.isoEnglishen_US
dc.source.title2010 IEEE International Conference on Systems, Man and Cyberneticsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ICSMC.2010.5642315en_US
dc.subjectAssignment problemsen_US
dc.subjectCombinatorial assignmenten_US
dc.subjectDocument evaluationen_US
dc.subjectOrdinal rankingen_US
dc.subjectPeer reviewen_US
dc.subjectAssignment problemsen_US
dc.subjectCombinatorial assignmenten_US
dc.subjectDocument evaluationen_US
dc.subjectOrdinal rankingen_US
dc.subjectPeer reviewen_US
dc.subjectCyberneticsen_US
dc.subjectInteger programmingen_US
dc.subjectOptimizationen_US
dc.subjectTracking (position)en_US
dc.subjectInformation retrieval systemsen_US
dc.titleOrdinal evaluation and assignment problemsen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Technology and Information Systemsen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage3284en_US
dc.citation.epage3289en_US
dc.identifier.doi10.1109/ICSMC.2010.5642315en_US
dc.publisherIEEEen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record