An experimental approach: The graph of graphs
Not on the map. Why?
Abstract (arXiv)
One of the essential issues in decision problems and preference modeling is the number of comparisons and their pattern to ask from the decision maker. We focus on the optimal patterns of pairwise comparisons and the sequence including the most (close to) optimal cases based on the results of a color selection experiment. In the test, six colors (red, green, blue, magenta, turquoise, yellow) were evaluated with pairwise comparisons as well as in a direct manner, on color-calibrated tablets in ISO standardized sensory test booths of a sensory laboratory. All the possible patterns of comparisons resulting in a connected representing graph were evaluated against the complete data based on 301 individual's pairwise comparison matrices (PCMs) using the logarithmic least squares weight calculation technique. It is shown that the empirical results, i.e., the empirical distributions of the elements of PCMs, are quite similar to the former simulated outcomes from the literature. The obtained empirically optimal patterns of comparisons were the best or the second best in the former simulations as well, while the sequence of comparisons that contains the most (close to) optimal patterns is exactly the same. In order to enhance the applicability of the results, besides the presentation of graph of graphs, and the representing graphs of the patterns that describe the proposed sequence of comparisons themselves, the recommendations are also detailed in a table format as well as in a Java application.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 44 references that are in the map. First posted on arXiv 24 Aug 2025.
Builds on
8 of 44 references.
References · 8
- 2016An application of incomplete pairwise comparison matrices for ranking top tennis playerscited by 11
- 2021Inconsistency thresholds for incomplete pairwise comparison matricescited by 5
- 2017The (logarithmic) least squares optimality of the arithmetic (geometric) mean of weight vectors calculated from all spanning trees for incomplete additive (multiplicative) pairwise comparison matricescited by 4
- 2020Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diametercited by 4
- 2021On the Derivation of Weights from Incomplete Pairwise Comparisons Matrices via Spanning Trees with Crisp and Fuzzy Confidence Levelscited by 3
- 2022Optimal sequences for pairwise comparisons: the graph of graphs approachcited by 1
- 2022The incomplete Analytic Hierarchy Process and Bradley-Terry model: (in)consistency and information retrievalcited by 1
- 2025An experimental approach: Converting verbal expressions to numerical scalescited by 1
Built on by
Not cited yet.