Incomplete Pairwise Comparison Matrices and Weighting Methods

László Csató, Lajos Rónyai

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

A special class of preferences, given by a directed acyclic graph, is considered. They are represented by incomplete pairwise comparison matrices as only partial information is available: for some pairs no comparison is given in the graph. A weighting method satisfies the linear order preservation property if it always results in a ranking such that an alternative directly preferred to another does not have a lower rank. We study whether two procedures, the Eigenvector Method and the Logarithmic Least Squares Method meet this axiom. Both weighting methods break linear order preservation, moreover, the ranking according to the Eigenvector Method depends on the incomplete pairwise comparison representation chosen.

Original languageEnglish
Pages (from-to)309-320
Number of pages12
JournalFundamenta Informaticae
Volume144
Issue number3-4
DOIs
Publication statusPublished - May 2 2016

Keywords

  • Directed acyclic graph
  • EigenvectorMethod
  • Logarithmic Least Squares Method
  • incomplete pairwise comparison matrix

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Incomplete Pairwise Comparison Matrices and Weighting Methods'. Together they form a unique fingerprint.

  • Cite this