• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Applied Schools
      • School of Applied Technology and Management
      • Computer Technology and Information Systems
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Applied Schools
      • School of Applied Technology and Management
      • Computer Technology and Information Systems
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Ordinal evaluation and assignment problems

      Thumbnail
      View / Download
      1.6 Mb
      Author
      Atmaca, Abdullah
      Oruç, A. Yavuz
      Date
      2010
      Source Title
      2010 IEEE International Conference on Systems, Man and Cybernetics
      Print ISSN
      1062-922X
      Publisher
      IEEE
      Pages
      3284 - 3289
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      113
      views
      61
      downloads
      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.
      Keywords
      Assignment problems
      Combinatorial assignment
      Document evaluation
      Ordinal ranking
      Peer review
      Assignment problems
      Combinatorial assignment
      Document evaluation
      Ordinal ranking
      Peer review
      Cybernetics
      Integer programming
      Optimization
      Tracking (position)
      Information retrieval systems
      Permalink
      http://hdl.handle.net/11693/28433
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/ICSMC.2010.5642315
      Collections
      • Computer Technology and Information Systems 61
      • Department of Computer Engineering 1368
      Show full item record

      Related items

      Showing items related by title, author, creator and subject.

      • Thumbnail

        Distributed joint flow-radio and channel assignment using partially overlapping channels in multi-radio wireless mesh networks 

        Ulucinar, A. R.; Korpeoglu, I. (Springer, 2016)
        Equipping mesh nodes with multiple radios that support multiple wireless channels is considered a promising solution to overcome the capacity limitation of single-radio wireless mesh networks. However, careful and intelligent ...
      • Thumbnail

        Ordinal covering using block designs 

        Atmaca, Abdullah; Oruc, A.Y. (IEEE, 2010)
        A frequently encountered problem in peer review systems is to facilitate pairwise comparisons of a given set of documents by as few experts as possible. In [7], it was shown that, if each expert is assigned to review k ...
      • Thumbnail

        Tree-based channel assignment schemes for multi-channel wireless sensor networks 

        Terzi, C.; Korpeoglu, I. (John Wiley & Sons Ltd., 2016)
        Many sensor node platforms used for establishing wireless sensor networks (WSNs) can support multiple radio channels for wireless communication. Therefore, rather than using a single radio channel for whole network, multiple ...

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy