Table of Contents
Fetching ...

On the coincidence of optimal completions for small pairwise comparison matrices with missing entries

László Csató, Kolos Csaba Ágoston, Sándor Bozóki

TL;DR

The two widely used inconsistency indices, Saaty's inconsistency index and the geometric inconsistency index, are proven to imply the same optimal filling for incomplete pairwise comparison matrices up to order four but not necessarily for order at least five.

Abstract

Incomplete pairwise comparison matrices contain some missing judgements. A natural approach to estimate these values is provided by minimising a reasonable measure of inconsistency after unknown entries are replaced by variables. Two widely used inconsistency indices for this purpose are Saaty's inconsistency index and the geometric inconsistency index, which are closely related to the eigenvector and the logarithmic least squares priority deriving methods, respectively. The two measures are proven to imply the same optimal filling for incomplete pairwise comparison matrices up to order four but not necessarily for order at least five.

On the coincidence of optimal completions for small pairwise comparison matrices with missing entries

TL;DR

The two widely used inconsistency indices, Saaty's inconsistency index and the geometric inconsistency index, are proven to imply the same optimal filling for incomplete pairwise comparison matrices up to order four but not necessarily for order at least five.

Abstract

Incomplete pairwise comparison matrices contain some missing judgements. A natural approach to estimate these values is provided by minimising a reasonable measure of inconsistency after unknown entries are replaced by variables. Two widely used inconsistency indices for this purpose are Saaty's inconsistency index and the geometric inconsistency index, which are closely related to the eigenvector and the logarithmic least squares priority deriving methods, respectively. The two measures are proven to imply the same optimal filling for incomplete pairwise comparison matrices up to order four but not necessarily for order at least five.
Paper Structure (4 sections, 3 theorems, 15 equations, 1 figure)

This paper contains 4 sections, 3 theorems, 15 equations, 1 figure.

Key Result

Lemma 1

The optimal solution to both optimisation problems eq_LLSM and eq_EM is unique if and only if the graph representing the incomplete pairwise comparison matrix is connected.

Figures (1)

  • Figure 1: The graph representation of the incomplete pairwise comparison matrix $\mathbf{A}$ in Example \ref{['Examp1']}

Theorems & Definitions (15)

  • Definition 2.1
  • Definition 2.2
  • Definition 2.3
  • Definition 2.4
  • Definition 2.5
  • Definition 2.6
  • Definition 2.7
  • Example 1
  • Lemma 1
  • proof
  • ...and 5 more