Abstract
Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. In case of incomplete data, the arrangements of known comparisons are crucial for the quality of results. We focus on decision problems where the set of pairwise comparisons can be chosen and it is designed completely before the decision making process, without any further prior information. The objective of this paper is to provide recommendations for filling patterns of incomplete pairwise comparison matrices based on their graph representation. The proposed graphs are regular and quasi-regular ones with minimal diameter (longest shortest path). Regularity means that each item is compared to others for the same number of times, resulting in a kind of symmetry. A graph on an odd number of vertices is called quasi-regular, if the degree of every vertex is the same odd number, except for one vertex whose degree is larger by one. We draw attention to the diameter, which is missing from the relevant literature, in order to remain the closest to direct comparisons. If the diameter of the graph of comparisons is as low as possible (among the graphs of the same number of edges), we can decrease the cumulated errors that are caused by the intermediate comparisons of a long path between two items. Contributions of this paper include a list containing (quasi-)regular graphs with diameter 2 and 3 up until 24 vertices. Extensive numerical tests show that the recommended graphs indeed lead to better weight vectors compared to various other graphs with the same number of edges. It is also revealed by examples that neither regularity nor small diameter is sufficient on its own, both properties are needed. Both theorists and practitioners can utilize the results, given in several formats in the appendix: plotted graph, adjacency matrix, list of edges, ‘Graph6’ code.
Highlights
Pairwise comparisons form the basis of preference measurement, ranking, psychometrics and decision modelling (Davidson and Farquhar, 1976; Thurstone, 1927; Zahedi, 1986)
We found that with k = 4 we can get 2 as the minimal diameter until n = 15, but for larger values of n, it will be 3 again, which can be reached by k = 3, we would not recommend these combinations of parameters
As for the calculation techniques of the weights derived from the pairwise comparison matrix (PCM), we used the wellknown Logarithmic Least Squares Method (LLSM) and the Eigenvector Method based on the CR-minimal completion (CREV) (Bozóki et al, 2010)
Summary
Pairwise comparisons form the basis of preference measurement, ranking, psychometrics and decision modelling (Davidson and Farquhar, 1976; Thurstone, 1927; Zahedi, 1986). One of the most commonly used techniques in connection with Multi-criteria Decision Making is the method of the pairwise comparison matrices. One can apply this technique both for determining the weights of the different criteria and for the rating of the alternatives according to a criterion. We denote the number of criteria or alternatives by n, which means the pairwise comparison matrix is an n × n matrix, often denoted by A. In this case the ij-th element of the A matrix, aij shows how many times the i-th item is larger/better than the j-th element
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
