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

DOI10.1007/BF02078898zbMath0812.90082MaRDI QIDQ1339200

Leszek Klukowski

Publication date: 15 May 1995

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

aggregationpairwise comparisonsnearest adjoining order methodnon-independent comparisonsprobabilistic properties

Mathematics Subject Classification ID

Decision theory (91B06) Management decision making, including multiple objectives (90B50) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Individual preferences (91B08)

Related Items (1)

Unnamed Item

Cites Work

• A note on paired comparison rankings
• A branch search algorithm for maximum likelihood paired comparison ranking
• Probability Inequalities for Sums of Bounded Random Variables
• Maximum-likelihood paired comparison rankings
• A branch and bound algorithm for maximum likelihood paired comparison ranking

This page was built for publication: Some probabilistic properties of the nearest adjoining order method and its extensions