• 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 covering using block designs

      Thumbnail
      View / Download
      756.8 Kb
      Author
      Atmaca, Abdullah
      Oruc, A.Y.
      Date
      2010
      Source Title
      2010 IEEE International Conference on Systems, Man and Cybernetics
      Print ISSN
      1062-922X
      Publisher
      IEEE
      Pages
      3340 - 3345
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      128
      views
      65
      downloads
      Abstract
      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 documents then ⌈n(n-1)/k(k-1)⌉ experts are necessary and ⌈n(2n-k)/k 2⌉ experts are sufficient to cover all n(n-1)/2 pairs of n documents. In this paper, we show that, if √n ≤ k ≤ n/2 then the upper bound can be improved using a new assignnment method based on a particular family of balanced incomplete block designs. Specifically, the new method uses ⌈n(n+k)/k2⌉ experts where n/k is a prime power, n divides k2, and √n ≤ k ≤ n/2. When k = √n , this new method uses the minimum number of experts possible and for all other values of k, where √n < k ≤ n/2, the new upper bound is tighter than the general upper bound given in [7]. ©2010 IEEE.
      Keywords
      Assignment problems
      Balanced incomplete block design
      Combinatorial assignment
      Document evaluation
      Ordinal ranking
      Peer review
      Assignment problems
      Balanced incomplete block design
      Combinatorial assignment
      Document evaluation
      Ordinal ranking
      Peer review
      Cybernetics
      Design
      Tracking (position)
      Combinatorial mathematics
      Permalink
      http://hdl.handle.net/11693/28449
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/ICSMC.2010.5642346
      Collections
      • Computer Technology and Information Systems 61
      • Department of Computer Engineering 1409
      Show full item record

      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
      © Bilkent University - Library IT

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