Ordinal evaluation and assignment problems
dc.citation.epage | 3289 | en_US |
dc.citation.spage | 3284 | en_US |
dc.contributor.author | Atmaca, Abdullah | en_US |
dc.contributor.author | Oruç, A. Yavuz | en_US |
dc.coverage.spatial | Istanbul, Turkey | en_US |
dc.date.accessioned | 2016-02-08T12:20:31Z | |
dc.date.available | 2016-02-08T12:20:31Z | |
dc.date.issued | 2010 | en_US |
dc.department | Department of Computer Technology and Information Systems | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.description | Date of Conference: 10-13 Oct. 2010 | en_US |
dc.description.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. ©2010 IEEE. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T12:20:31Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2010 | en |
dc.identifier.doi | 10.1109/ICSMC.2010.5642315 | en_US |
dc.identifier.issn | 1062-922X | |
dc.identifier.uri | http://hdl.handle.net/11693/28433 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/ICSMC.2010.5642315 | en_US |
dc.source.title | 2010 IEEE International Conference on Systems, Man and Cybernetics | en_US |
dc.subject | Assignment problems | en_US |
dc.subject | Combinatorial assignment | en_US |
dc.subject | Document evaluation | en_US |
dc.subject | Ordinal ranking | en_US |
dc.subject | Peer review | en_US |
dc.subject | Assignment problems | en_US |
dc.subject | Combinatorial assignment | en_US |
dc.subject | Document evaluation | en_US |
dc.subject | Ordinal ranking | en_US |
dc.subject | Peer review | en_US |
dc.subject | Cybernetics | en_US |
dc.subject | Integer programming | en_US |
dc.subject | Optimization | en_US |
dc.subject | Tracking (position) | en_US |
dc.subject | Information retrieval systems | en_US |
dc.title | Ordinal evaluation and assignment problems | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Ordinal evaluation and assignment problems.pdf
- Size:
- 1.59 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version