A lexicographically optimal completion for pairwise comparison matrices with missing entries
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929213249945600 |
|---|---|
| author | Ágoston, Kolos Csaba Csató, László |
| author_facet | Ágoston, Kolos Csaba Csató, László |
| contents | Estimating missing judgements is a key component in many multi-criteria decision making techniques, especially in the Analytic Hierarchy Process. Inspired by the Koczkodaj inconsistency index and a widely used solution concept of cooperative game theory called the nucleolus, the current study proposes a new algorithm for this purpose. In particular, the missing values are substituted by variables, and the inconsistency of the most inconsistent triad is reduced first, followed by the inconsistency of the second most inconsistent triad, and so on. The necessary and sufficient condition for the uniqueness of the suggested lexicographically optimal completion is proved to be a simple graph-theoretic notion: the undirected graph associated with the pairwise comparisons, where the edges represent the known elements, should be connected. Crucially, our method does not depend on an arbitrarily chosen measure of inconsistency as there exists essentially one reasonable triad inconsistency index. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_10440 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | A lexicographically optimal completion for pairwise comparison matrices with missing entries Ágoston, Kolos Csaba Csató, László Optimization and Control 90-10, 90B50, 91B08 Estimating missing judgements is a key component in many multi-criteria decision making techniques, especially in the Analytic Hierarchy Process. Inspired by the Koczkodaj inconsistency index and a widely used solution concept of cooperative game theory called the nucleolus, the current study proposes a new algorithm for this purpose. In particular, the missing values are substituted by variables, and the inconsistency of the most inconsistent triad is reduced first, followed by the inconsistency of the second most inconsistent triad, and so on. The necessary and sufficient condition for the uniqueness of the suggested lexicographically optimal completion is proved to be a simple graph-theoretic notion: the undirected graph associated with the pairwise comparisons, where the edges represent the known elements, should be connected. Crucially, our method does not depend on an arbitrarily chosen measure of inconsistency as there exists essentially one reasonable triad inconsistency index. |
| title | A lexicographically optimal completion for pairwise comparison matrices with missing entries |
| topic | Optimization and Control 90-10, 90B50, 91B08 |
| url | https://arxiv.org/abs/2206.10440 |