Pairwise comparison buys lower variance at an aggregation cost
Humans and judges are far more consistent at choosing between two answers than at assigning absolute scores. Pairwise comparison asks 'which is better?' and allows ties. The cost is that win rates must be aggregated across pairs to recover a ranking, usually through Bradley-Terry or Elo.
Lower variance
Relative judgments remove scale ambiguity: the judge only needs to order two options, not calibrate an absolute scale.
Allow ties
Forcing a winner when answers are equivalent injects false wins and biases the ranking.
Aggregate to a ranking
Fit Bradley-Terry: P(A beats B) = σ(r_A − r_B), then convert ratings to win rates.
A rating gap of 2.2 logits corresponds to roughly a 90% win probability. Pairwise outcomes across many models fit this single model jointly.
- Chatbot Arena exposes only pairwise battles and fits a Bradley-Terry model to produce Elo-like ratings.
- Pairwise judging requires O(n²) comparisons for n models, so organizers use sparse battle schedules.