Improving the Ordinal Inconsistency of Pairwise Comparison Matrices

Ludmil Mikhailov; Fabio De Felice; Emilio Esposito; Thomas Saaty

Improving the Ordinal Inconsistency of Pairwise Comparison Matrices

Ludmil Mikhailov, Fabio De Felice (Editor), Emilio Esposito (Editor), Thomas Saaty (Editor)

MSM Decision Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The paper investigates the effects of non-transitive judgments on the consistency of pairwise comparison matrices and proposes a heuristic algorithm for identifying and eliminating their ordinal inconsistencies. The algorithm is based on graphical representation of the comparison matrices and identifies the edges in the digraph, which are mostly responsible for three-way cycles, representing the ordinal inconsistencies. The algorithm tries to minimize the number of edge reversals and provides results, similar to those obtained by an optimization method,

Original language	English
Title of host publication	Proceedings of the 11th International Symposium on the AHP
Editors	Fabio De Felice, Emilio Esposito, Thomas Saaty
Place of Publication	Pittsburg, USA
Publisher	AHP Academy
Publication status	Published - 15 Jun 2011
Event	11th International Symposium on the AHP - Sorrento, Italy Duration: 15 Jun 2011 → 18 Jun 2011

Conference

Conference	11th International Symposium on the AHP
City	Sorrento, Italy
Period	15/06/11 → 18/06/11

Keywords

Pairwise Comparisons
Non-transitive Judgements
Heuristics

Cite this

@inproceedings{ec1d3b2d771948b39c5eedb03f1f5a83,

title = "Improving the Ordinal Inconsistency of Pairwise Comparison Matrices",

abstract = "The paper investigates the effects of non-transitive judgments on the consistency of pairwise comparison matrices and proposes a heuristic algorithm for identifying and eliminating their ordinal inconsistencies. The algorithm is based on graphical representation of the comparison matrices and identifies the edges in the digraph, which are mostly responsible for three-way cycles, representing the ordinal inconsistencies. The algorithm tries to minimize the number of edge reversals and provides results, similar to those obtained by an optimization method,",

keywords = "Pairwise Comparisons, Non-transitive Judgements, Heuristics",

author = "Ludmil Mikhailov and {De Felice}, Fabio and Emilio Esposito and Thomas Saaty",

year = "2011",

month = jun,

day = "15",

language = "English",

editor = "{De Felice}, Fabio and Emilio Esposito and Thomas Saaty",

booktitle = "Proceedings of the 11th International Symposium on the AHP",

publisher = "AHP Academy",

address = "Italy",

note = "11th International Symposium on the AHP ; Conference date: 15-06-2011 Through 18-06-2011",

}

Improving the Ordinal Inconsistency of Pairwise Comparison Matrices. / Mikhailov, Ludmil; De Felice, Fabio (Editor); Esposito, Emilio (Editor) et al.

Proceedings of the 11th International Symposium on the AHP. ed. / Fabio De Felice; Emilio Esposito; Thomas Saaty. Pittsburg, USA : AHP Academy, 2011.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Improving the Ordinal Inconsistency of Pairwise Comparison Matrices

AU - Mikhailov, Ludmil

A2 - De Felice, Fabio

A2 - Esposito, Emilio

A2 - Saaty, Thomas

A2 - De Felice, Fabio

A2 - Esposito, Emilio

A2 - Saaty, Thomas

PY - 2011/6/15

Y1 - 2011/6/15

N2 - The paper investigates the effects of non-transitive judgments on the consistency of pairwise comparison matrices and proposes a heuristic algorithm for identifying and eliminating their ordinal inconsistencies. The algorithm is based on graphical representation of the comparison matrices and identifies the edges in the digraph, which are mostly responsible for three-way cycles, representing the ordinal inconsistencies. The algorithm tries to minimize the number of edge reversals and provides results, similar to those obtained by an optimization method,

AB - The paper investigates the effects of non-transitive judgments on the consistency of pairwise comparison matrices and proposes a heuristic algorithm for identifying and eliminating their ordinal inconsistencies. The algorithm is based on graphical representation of the comparison matrices and identifies the edges in the digraph, which are mostly responsible for three-way cycles, representing the ordinal inconsistencies. The algorithm tries to minimize the number of edge reversals and provides results, similar to those obtained by an optimization method,

KW - Pairwise Comparisons

KW - Non-transitive Judgements

KW - Heuristics

M3 - Conference contribution

BT - Proceedings of the 11th International Symposium on the AHP

PB - AHP Academy

CY - Pittsburg, USA

T2 - 11th International Symposium on the AHP

Y2 - 15 June 2011 through 18 June 2011

ER -

Improving the Ordinal Inconsistency of Pairwise Comparison Matrices

Abstract

Conference

Keywords

Fingerprint

Cite this