Name
Abstract | ||
|---|---|---|
Determining the most suitable prioritization method for pairwise comparisons remains an open problem. This paper proposes a method based on the generation of all possible preferences from a set of judgments in pairwise comparisons. A concept of pivotal combination is introduced using a graph-theoretic approach. A set of preferences is generated by enumerating all spanning trees. The mean of these preferences is proposed as a final priority vector, and variance gives a measure of inconsistency. The proposed method provides a way of ordering objects according to a voting scheme. The proposed method is also applicable to incomplete sets of pairwise comparisons without modification, unlike other popular methods which require intermediate steps to estimate missing judgments. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.cor.2011.03.010 | Computers & OR |
Keywords | DocType | Volume |
open problem,final priority vector,incomplete set,graph-theoretic approach,suitable prioritization method,intermediate step,popular method,pairwise comparison,missing judgment,proposed method | Journal | 39 |
Issue | ISSN | Citations |
2 | 0305-0548 | 8 |
PageRank | References | Authors |
0.51 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Siraj | 1 | 8 | 0.51 |
| L. Mikhailov | 2 | 195 | 16.61 |
| J. A. Keane | 3 | 96 | 7.33 |