arbiter
JournalsAccount

Consistent Completion of Pairwise Comparison Diagonal Block Matrices

Julio Benítez & Carlos Alberto Serra Jiménez

Journal of Multi-Criteria Decision Analysis2025https://doi.org/10.1002/mcda.70023article
AJG 1ABDC B
Weight
0.50

Abstract

In this article, we study the problem of how to complete a matrix whose blocks on the main diagonal are reciprocal and known and the blocks outside the main diagonal are unknown. All entries in the main diagonal blocks are known, which means that a partition of the set of alternatives is made and all judgements are made on each subset . First, we study the case when a consistent completion exists and find it. Second, if it is not possible, we find the most consistent completion possible. To this end, we use graph theory.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1002/mcda.70023

Or copy a formatted citation

@article{julio2025,
  title        = {{Consistent Completion of Pairwise Comparison Diagonal Block Matrices}},
  author       = {Julio Benítez & Carlos Alberto Serra Jiménez},
  journal      = {Journal of Multi-Criteria Decision Analysis},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.1002/mcda.70023},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Consistent Completion of Pairwise Comparison Diagonal Block Matrices

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.