Skip to main content
Log in

Some probabilistic properties of the nearest adjoining order method and its extensions

  • Section V Procedural And Algorithmic Aspects Of Group Decision Making
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, some probabilistic properties of the nearest adjoining order (NAO) method are presented. They have been obtained under weaker assumptions than those commonly used, i.e. it is not assumed that comparisons are not independent and that probability of comparison errors are known. The results presented comprise the evaluation of the probability of obtaining an errorless solution with the use of the NAO method; asymptotic properties of this solution derived under the assumption that comparisons of different pairs (i.e. pairsx i ,x j andx r ,x r forir,s andjr,s) are not correlated — for the case of one expert. An extension of results for the case ofN > 1 independent experts is also presented. This extension is accomplished by including an additional step — the aggregation of comparisons made by all experts for each pair of objects. Two ways of such an aggregation are analyzed: the averaging of experts' opinions and the majority principle. In the latter case, the result of the comparison is the same as the opinion of the majority of experts. The results obtained indicate an exponential convergence of the probability of the NAO solution to an errorless one in both cases. However, an application of the majority principle leads to a minimization problem, which is the same as in the case ofN = 1 and is much simpler than that corresponding to averaging of comparisons.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. H.A. David,The Mathod of Paired Comparisons, 2nd ed. (Ch. Griffin, London, 1988).

    Google Scholar 

  2. J.S. DeCani, A branch and bound algorithm for maximum likelihood paired comparison ranking, Biometrika 59(1972)131–135.

    Google Scholar 

  3. J.A. Flueck and J.F. Korsh, An approach to maximum likelihood paired comparisons ranking, Biometrika 61(1975)621–626.

    Google Scholar 

  4. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58, No. 301 (1963) 13–30.

    Google Scholar 

  5. L. Klukowski, Ranking of elements on the basis of pairwise comparisons with random error (in Polish), in:Badania Systemowe, Vol. 3, ed. R. Kulikowski and J. Kacprzyk (Omnitech Press, Warszawa, 1990) pp. 212–268.

    Google Scholar 

  6. L. Klukowski and D. Wagner, Uncertainty in the analytic hierarchy process,Proc. 3rd Polish-Finnish Symp. on Methodology and Application of Decision Support Systems, ed. R. Kulikowski (IBS PAN, Warszawa, 1989) pp. 106–120.

    Google Scholar 

  7. R. Remage, Jr. and W.A. Thomspn, Jr., Maximum-likelihood paired comparison rankings, Biometrika 53(1966)143–149.

    Google Scholar 

  8. J. Singh, A note on paired comparison rankings, Ann. Statist. 4(1976)651–654.

    Google Scholar 

  9. P. Slater, Inconsistencies in a schedule of paired comparisons, Biometrika 48(1961)303–312.

    Google Scholar 

  10. U.A. Zuiev, The probabilistic model of the classifiers' committee (in Russian), Zh. Vychislitielnoy Matematiki i Matematicheskoy Fiziki 26(1986)276–291.

    Google Scholar 

  11. J.P.N. Phillips, A further procedure for determining Slater'si and all nearest adjoining orders, British J. Math. Statist. Psychol. 22(1969)97–101.

    Google Scholar 

  12. A.F.M. Smith and C.D. Payne, An algorithm for determining Slater'si and all nearest adjoining orders, British J. Math. Statist. Psychol. 27(1974)49–52.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klukowski, L. Some probabilistic properties of the nearest adjoining order method and its extensions. Ann Oper Res 51, 241–261 (1994). https://doi.org/10.1007/BF02078898

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02078898

Keywords

Navigation