Consistent Completion of Pairwise Comparison Diagonal Block Matrices
[EN] In this article, we study the problem of how to complete a matrix whose blocks on the main diagonal are reciprocal and knownand the blocks outside the main diagonal are unknown. All entries in the main diagonal blocks are known, which means that apartition A1, ¿ , A r of the set of alternatives...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2025 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:dnet:riunet______::bdaf8793c5a5c460159f6db77031b8b9 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/234909 |
| Access Level: | acceso embargado |
| Palabra clave: | Decision-making Graph theory Incomplete pairwise comparison matrices |
| Sumario: | [EN] In this article, we study the problem of how to complete a matrix whose blocks on the main diagonal are reciprocal and knownand the blocks outside the main diagonal are unknown. All entries in the main diagonal blocks are known, which means that apartition A1, ¿ , A r of the set of alternatives is made and all judgements are made on each subset A i. First, we study the casewhen a consistent completion exists and find it. Second, if it is not possible, we find the most consistent completion possible. Tothis end, we use graph theory. |
|---|