کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1137385 | 1489168 | 2010 | 16 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: On optimal completion of incomplete pairwise comparison matrices On optimal completion of incomplete pairwise comparison matrices](/preview/png/1137385.png)
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.
Journal: Mathematical and Computer Modelling - Volume 52, Issues 1–2, July 2010, Pages 318–333