Transitive approximation to pairwise comparison matrices by using interval goal programming

Abstract

Paired comparison is a very popular method for establishing the relative importance of n objects, when they cannot be directly rated. The challenge faced by the pairwise comparison method stems from some missing properties in its associated matrix. In this paper, we focus on the following general problem: given a non-reciprocal and inconsistent matrix computing intransitivities, what is its associated ranking (defined by importance values)? We propose to use inconsistencies as a source of information for obtaining importance values. For this purpose, a methodology with a decomposition and aggregation phase is proposed. Interval Goal Programming will be a useful tool for implementing the aggregation process defined in the second phase.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 41 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.