# Pairwise comparison

﻿
Pairwise comparison

Pairwise comparison generally refers to any process of comparing entities in pairs to judge which of each entity is preferred, or has a greater amount of some quantitative property. The method of pairwise comparison is used in the scientific study of preferences, attitudes, voting systems, social choice, public choice, and multiagent AI systems. In psychology literature, it is often referred to as paired comparison.

Prominent psychometrician L. L. Thurstone first introduced a scientific approach to using pairwise comparisons for measurement in 1927, which he referred to as the law of comparative judgment. Thurstone linked this approach to psychophysical theory developed by Ernst Heinrich Weber and Gustav Fechner. Thurstone demonstrated that the method can be used to order items along a dimension such as preference or importance using an interval-type scale.

## Overview

If an individual or organization expresses a preference between two mutually distinct alternatives, this preference can be expressed as a pairwise comparison. If the two alternatives are x and y, the following are the possible pairwise comparisons:

The agent prefers x over y: "x > y" or "xPy"

The agent prefers y over x: "y > x" or "yPx"

The agent is indifferent between both alternatives: "x = y" or "xIy"

## Probabilistic models for pairwise comparison

In terms of modern psychometric theory, Thurstone's approach, called the law of comparative judgment, is more aptly regarded as a measurement model. The Bradley–Terry–Luce (BTL) model (Bradley & Terry, 1952; Luce, 1959) is often applied to pairwise comparison data to scale preferences. The BTL model is identical to Thurstone's model if the simple logistic function is used. Thurstone used the normal distribution in applications of the model. The simple logistic function varies by less than 0.01 from the cumulative normal ogive across the range, given an arbitrary scale factor.

In the BTL model, the probability that object j is judged to have more of an attribute than object i is: $\Pr \{X_{ji}=1\} =\frac{e^{{\delta_j} - {\delta_i}}}{1 + e^{{\delta_j} - {\delta_i}}} = \operatorname{logit}^{-1} (\delta_j - \delta_i),$

where δi is the scale location of object i; $\operatorname{logit}^{-1}$ is the inverse logit function. For example, the scale location might represent the perceived quality of a product, or the perceived weight of an object.

The BTL is very closely related to the Rasch model for measurement.

Thurstone used the method of pairwise comparisons as an approach to measuring perceived intensity of physical stimuli, attitudes, preferences, choices, and values. He also studied implications of the theory he developed for opinion polls and political voting (Thurstone, 1959).

## Transitivity of pairwise comparisons

For a given decision agent, if the information, objective, and alternatives used by the agent remain constant, then it is generally assumed that pairwise comparisons over those alternatives by the decision agent are transitive. Most agree upon what transitivity is, though there is debate about the transitivity of indifference. The rules of transitivity are as follows for a given decision agent.

If xPy and yPz, then xPz

If xPy and yIz, then xPz

If xIy and yPz, then xPz

If xIy and yIz, then xIz

This corresponds to (xPy or xIy) being a total preorder, P being the corresponding strict weak order, and I being the corresponding equivalence relation.

Probabilistic models require transitivity only within the bounds of errors of estimates of scale locations of entities. Thus, decisions need not be deterministically transitive in order to apply probabilistic models. However, transitivity will generally hold for a large number of comparisons if models such as the BTL can be effectively applied.

## Argument for intransitivity of indifference

Some contend that indifference is not transitive. Consider the following example. Suppose you like apples and you prefer apples that are larger. Now suppose there exists an apple A, an apple B, and an apple C which have identical intrinsic characteristics except for the following. Suppose B is larger than A, but it is not discernible without an extremely sensitive scale. Further suppose C is larger than B, but this also is not discernible without an extremely sensitive scale. However, the difference in sizes between apples A and C is large enough that you can discern that C is larger than A without a sensitive scale. In psychophysical terms, the size difference between A and C is above the just noticeable difference ('jnd') while the size differences between A and B and B and C are below the jnd.

You are confronted with the three apples in pairs without the benefit of a sensitive scale. Therefore, when presented A and B alone, you are indifferent between apple A and apple B; and you are indifferent between apple B and apple C when presented B and C alone. However, when the pair A and C are shown, you prefer C over A.

## Preference orders

If pairwise comparisons are in fact transitive in respect to the four mentioned rules, then pairwise comparisons for a list of alternatives (A1A2A3, ..., An−1, and An) can take the form:

A1(>XOR=)A2(>XOR=)A3(>XOR=) ... (>XOR=)An−1(>XOR=)An

For example, if there are three alternatives a, b, and c, then the possible preference orders are:

• a > b > c
• a > c > b
• b > a > c
• b > c > a
• c > a > b
• c > b > a
• a > b = c
• b = c > a
• b > a = c
• a = c > b
• c > a = b
• a = b > c
• a = b = c

If the number of alternatives is n, and indifference is not allowed, then the number of possible preference orders for any given n-value is n!. If indifference is allowed, then the number of possible preference orders is the number of total preorders. It can be expressed as a function of n: $\sum_{k=1}^n k! S_2(n,k),$

where S2(nk) is the Stirling number of the second kind.

## Applications

One important application of pairwise comparisons is the widely-used Analytic Hierarchy Process, a structured technique for helping people deal with complex decisions. It uses pairwise comparisons of tangible and intangible factors to construct ratio scales that are useful in making important decisions.

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Pairwise — may refer to: * Pairwise deletion * Pairwise disjoint * Pairwise independent * PAIRwise Paper Authorship Integrity Research an open source software to detect plagiarism * Pairwise comparison, the process of comparing two entities to determine… …   Wikipedia

• Pairwise testing — may refer to: *All pairs testing *Pairwise comparison …   Wikipedia

• Comparison — For comparisons within Wikipedia, see Category:Comparisons. Contents 1 Computer science 2 Language 3 Mathemat …   Wikipedia

• Fiocruz Genome Comparison Project — The Fiocruz Genome Comparison Project is a collaborative effort involving Brazil s Oswaldo Cruz Institute and IBM s World Community Grid, designed to produce a database comparing the genes from many genomes with each other using SSEARCH… …   Wikipedia

• Condorcet method — Part of the Politics series Electoral methods Single winner …   Wikipedia

• Voting system — For other uses, see Voting system (disambiguation). Part of the Politics series Electoral methods …   Wikipedia

• Kemeny–Young method — Part of the Politics series Electoral methods Single winner …   Wikipedia

• Multiple sequence alignment — A multiple sequence alignment (MSA) is a sequence alignment of three or more biological sequences, generally protein, DNA, or RNA. In many cases, the input set of query sequences are assumed to have an evolutionary relationship by which they… …   Wikipedia

• Kemeny-Young method — The Kemeny Young method is a voting system that uses preferential ballots, pairwise comparison counts, and sequence scores to identify the most popular choice, and also identify the second most popular choice, the third most popular choice, and… …   Wikipedia

• Tukey-Kramer method — The Tukey method (also known as Tukey s Honest Significance Test), named for John Tukey, is a single step multiple comparison procedure which applies simultaneously to the set of all pairwise comparisons:mu i mu jThe confidence coefficient for… …   Wikipedia