首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The nearest adjoining order method for pairwise comparisons in the form of difference of ranks
Authors:Leszek Klukowski
Abstract:The problem of ranking of elements from some finite set on the basis of nearest adjoining order method for pairwise comparisons is investigated in this paper. It is assumed that in the set under consideration there exists a weak preference relation, which is to be identified (estimated) on the basis of pairwise comparisons in the form of difference of ranks. Moreover, the results of comparisons may be disturbed with random errors; the assumptions made about error distributions are not restrictive. The paper comprises: the problem formulation (definitions, assumptions, and optimisation problem, which provides the NAO solution) and the theoretical background – the form of distributions of random variables which make it possible to determine the properties of NAO solution, in particular, evaluation of the probability, that the NAO solution is equivalent to the errorless one. The approach presented in the paper can be extended to the case of more than one comparison for each pair of elements, i.e., completely formalised multi-experts ranking procedure. This revised version was published online in June 2006 with corrections to the Cover Date.
Keywords:nearest adjoining order method  pairwise comparisons  difference of ranks comparisons
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号