Geometric interpretation of efficient weight vectors

Pairwise comparison matrices (PCMs) are frequently used in different multicriteria decision making problems. A weight vector is said to be efficient if no other weight vector is at least as good in estimating the elements of the PCM, and strictly better in at least one position. Understanding the efficient weight vectors is crucial to determine the appropriate weight calculation technique for a given problem. In this paper we study the set of efficient weight vectors for three and four dimensions (alternatives) from a geometric viewpoint, which is a complementary to the algebraic approach used in the literature. Besides providing well-interpretable demonstrations, we also draw attention to the particular role of weight vectors calculated from spanning trees. Weight vectors corresponding to line graphs are vertices of the (polyhedral, but usually nonconvex) set of efficient weight vectors, while weight vectors corresponding to other spanning trees are also on the boundary.

Authors

Institutions

Publication Details

Journal
Knowledge-Based Systems
Published
2024-08-25
DOI
https://doi.org/10.1016/j.knosys.2024.112403
Citations
3
Primary Topic
Multi-Criteria Decision Making
Type
article
Field-Weighted Citation Impact
1.47

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Geometric interpretation of efficient weight vectors

Zsombor Szádoczki, Sándor Bozóki
3 citations
Knowledge-Based Systems
Multi-Criteria Decision Making
1.47
article

Geometric interpretation of efficient weight vectors

Zsombor Szádoczki, Sándor Bozóki
article en
3 citations

Abstract

Pairwise comparison matrices (PCMs) are frequently used in different multicriteria decision making problems. A weight vector is said to be efficient if no other weight vector is at least as good in estimating the elements of the PCM, and strictly better in at least one position. Understanding the efficient weight vectors is crucial to determine the appropriate weight calculation technique for a given problem. In this paper we study the set of efficient weight vectors for three and four dimensions (alternatives) from a geometric viewpoint, which is a complementary to the algebraic approach used in the literature. Besides providing well-interpretable demonstrations, we also draw attention to the particular role of weight vectors calculated from spanning trees. Weight vectors corresponding to line graphs are vertices of the (polyhedral, but usually nonconvex) set of efficient weight vectors, while weight vectors corresponding to other spanning trees are also on the boundary.

Knowledge-Based SystemsVol. 303
Corvinus University of Budapest (HU), HUN-REN Institute for Computer Science and Control (HU)
Nemzeti Kutatási, Fejlesztési és Innovaciós Alap, National Research, Development and Innovation Office
Openalex Percentile: Top 16%
Multi-Criteria Decision Making
1.47
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.