2013•arXiv (Cornell University)Open access

Pairwise Comparisons Simplified

Waldemar W. Koczkodaj, Jacek Szybowski

Open full text 0 citations

Abstract

This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from $n\cdot (n-1)$ to $n-1$. An algorithm of reconstructing of the PC matrix from its set of generators is presented.

Open-access reader

About this research paper

What this paper is about

This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from $n\cdot (n-1)$ to $n-1$. An algorithm of reconstructing of the PC matrix from its set of generators is presented.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from $n\cdot (n-1)$ to $n-1$. An algorithm of reconstructing of the PC matrix from its set of generators is presented.

Key concepts: Pairwise comparison, Set (abstract data type), Matrix (chemical analysis), Mathematics, Statistics, Combinatorics, Algorithm, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Pairwise Comparisons Simplified — Research Paper | ScholarLens