### Abstract

An important variant of a key problem for multi-attribute decision making is considered. We study the extension of the pairwise comparison matrix to the case when only partial information is available: for some pairs no comparison is given. It is natural to define the inconsistency of a partially filled matrix as the inconsistency of its best, completely filled completion. Here we study the uniqueness problem of the best completion for two weighting methods, the Eigenvector Method and the Logarithmic Least Squares Method. In both settings we obtain the same simple graph theoretic characterization of the uniqueness. The optimal completion will be unique if and only if the graph associated with the partially defined matrix is connected. Some numerical examples are discussed at the end of the paper.

Original language | English |
---|---|

Pages (from-to) | 318-333 |

Number of pages | 16 |

Journal | Mathematical and Computer Modelling |

Volume | 52 |

Issue number | 1-2 |

DOIs | |

Publication status | Published - Jul 1 2010 |

### Fingerprint

### Keywords

- Convex programming
- Incomplete pairwise comparison matrix
- Multiple criteria analysis
- Perron eigenvalue

### ASJC Scopus subject areas

- Modelling and Simulation
- Computer Science Applications

### Cite this

*Mathematical and Computer Modelling*,

*52*(1-2), 318-333. https://doi.org/10.1016/j.mcm.2010.02.047