Pairwise Comparison
Updated 2026-08-15
INTRODUCTION
English translation pending.
CORE DEFINITION
Pairwise comparison judges every option against every other, one pair at a time, and aggregates the results into a ranking. The core proposition is that people compare two items far more reliably than they rank many, so decomposing a global ordering into a series of binary judgments is both more accurate and less draining. The key qualification is that the number of pairs grows quadratically, so the method strains when options are many, and cyclic preferences must be surfaced rather than smoothed over.
SCAFFOLDING EFFECT
Reduce cognitive load
- Reduce To Pairs: judge exactly two options at a time, never the whole field. - Tally The Wins: count up the victories or the weights to build the order. - Expose The Inconsistency: look for preference cycles instead of hiding them.
Anchor fast decisions
Working memory cannot hold many options in a stable order, but it judges a pair easily and consistently. Splitting the problem into pairs and aggregating the results turns one impossibly wide comparison into many narrow ones, and the comparison matrix reveals cyclic preferences instead of burying them inside a false linear ranking.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Pairwise_comparisonverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS