Optimal sequences for pairwise comparisons: the graph of graphs approach

Zsombor Szádoczki () and Sándor Bozóki ()
Additional contact information
Zsombor Szádoczki: HUN-REN Institute for Computer Science and Control (HUN-REN SZTAKI)
Sándor Bozóki: HUN-REN Institute for Computer Science and Control (HUN-REN SZTAKI)

Annals of Operations Research, 2025, vol. 353, issue 3, No 9, 1099-1122

Abstract: Abstract In preference modelling, it is essential to determine the number of questions and their arrangements to ask from the decision maker. We focus on incomplete pairwise comparison matrices, and provide the optimal filling in patterns, which result in the closest weight vectors on average to the complete case for at most six alternatives and for all possible number of comparisons, when the underlying representing graph is connected. These results are obtained by extensive numerical simulations with large sample sizes. Many optimal filling structures resulted in optimal filling in sequences—one optimal case can be reached by adding a comparison to a previous one—which are presented on graph of graphs. The star graph is revealed to be optimal among spanning trees, while the optimal graphs are always close to bipartite ones. Regular graphs also correspond to optimal cases, furthermore regularity is important for all optimal graphs, as the degrees of different vertices are always as close to each other as possible. Besides applying optimal filling structures in given decision making problems, practitioners can utilize the optimal filling sequences in the cases, when the decision maker can abandon the problem at any period of the process (e.g., in online questionnaires).

Keywords: Pairwise comparison; Incomplete pairwise comparison matrix; Graph of comparisons; Filling in sequence; Graph of graphs (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-025-06752-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:353:y:2025:i:3:d:10.1007_s10479-025-06752-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-025-06752-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().