Skip to main content
Conference Proceedings

Building consistent pairwise comparison matrices over abelian linearly ordered groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5783 LNAI 237-248
DOI: 10.1007/978-3-642-04428-1_21
8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the paper, algorithms are provided to check the consistency of pairwise comparison matrices and to build consistent matrices over abelian linearly ordered groups. A measure of consistency is also given; this measure improves a consistent index provided in a previous paper. © 2009 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Cavallo, B., D’Apuzzo, L., & Squillante, M. (2009). Building consistent pairwise comparison matrices over abelian linearly ordered groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5783 LNAI, pp. 237–248). https://doi.org/10.1007/978-3-642-04428-1_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free