Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Perhaps the most widely-used probability model for predicting the outcome of a paired comparison is the Bradley-Terry model (BTM) (Bradley & Terry, 1952).”
From Big ideas in sports analytics and statistical tools for their investigation (2023) · cites this paper as Bradley & Terry, 1952
In the citing paper
“This follows the Bradley-Terry model (Bradley and Terry, 1952) for estimating score functions from pairwise preferences, and is the specialization of the Luce-Shephard choice rule (Luce, 2005; Shepard, 1957) to preferences over trajectory segments.”
From Deep reinforcement learning from human preferences (2017) · cites this paper as Bradley and Terry, 1952
Citations
Cites
Statistical Tables for Biological, Agricultural and Medical Research.
Reed, L. J., Fisher, R. A., & Yates, F. (1944) · Journal of the American Statistical Association · doi:10.2307/2280633 · Cited by 2,998
BRADLEY, R. A. (1954) · Biometrika · doi:10.1093/biomet/41.3-4.502 · Cited by 716
Self-citationON THE METHOD OF PAIRED COMPARISONS
Kendall, M. G., & Smith, B. B. (1940) · Biometrika · doi:10.1093/biomet/31.3-4.324 · Cited by 557
Cited by
Items 1,001–1,012 of 1,012
The Authenticity Gap in Human Evaluation
Ethayarajh, K., & Jurafsky, D. (2022) · Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2022.emnlp-main.406 · Cited by 10
Widmer, C. L., Sarker, M. K., Nadella, S., Fiechter, J., Juvina, I., Minnery, B., Hitzler, P., Schwartz, J., & Raymer, M. (2023) · Journal of Web Semantics · doi:10.1016/j.websem.2023.100807 · Cited by 10
RouteLLM: Learning to Route LLMs with Preference Data
Ong, I., Almahairi, A., Wu, V., Chiang, W.-L., Wu, T., Gonzalez, J. E., Kadous, M. W., & Stoica, I. (2024) · arXiv · doi:10.48550/arxiv.2406.18665 · Cited by 15
AI Alignment with Changing and Influenceable Reward Functions
Carroll, M., Foote, D., Siththaranjan, A., Russell, S., & Dragan, A. (2024) · arXiv · doi:10.48550/arxiv.2405.17713 · Cited by 7
Make The Most of Prior Data: A Solution for Interactive Text Summarization with Preference Feedback
Nguyen, D.-H., Nghiem, N. V. D., Nguyen, B.-S., Tien Le, D. T., Sabahi, S., Nguyen, M.-T., & Le, H. (2022) · Findings of the Association for Computational Linguistics: NAACL 2022 · doi:10.18653/v1/2022.findings-naacl.147 · Cited by 6
Smaug: Fixing Failure Modes of Preference Optimisation with DPO-Positive
Pal, A., Karkhanis, D., Dooley, S., Roberts, M., Naidu, S., & White, C. (2024) · arXiv · doi:10.48550/arxiv.2402.13228 · Cited by 6
Han, B., Ma, Y., Coghlan, S., McKay, D., Buchanan, G., & Smith, W. (2026) · Proceedings of the 2026 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3772318.3790360 · Cited by 3
“Pairwise comparisons (Table.4) were analysed with the Bradley-Terry Model [20] to estimate the probability of each concern being prioritised over another.”
Comparative judgement for advancing research in applied linguistics
Thwaites, P., & Paquot, M. (2024) · Research Methods in Applied Linguistics · doi:10.1016/j.rmal.2024.100142 · Cited by 3
Search Arena: Analyzing Search-Augmented LLMs
Miroyan, M., Wu, T.-H., King, L., Li, T., Pan, J., Hu, X., Chiang, W.-L., Angelopoulos, A. N., Darrell, T., Norouzi, N., et al. (2025) · arXiv · doi:10.48550/arxiv.2506.05334 · Cited by 1
On The Fragility of Learned Reward Functions
McKinney, L., Duan, Y., Krueger, D., & Gleave, A. (2023) · arXiv · doi:10.48550/arxiv.2301.03652 · Cited by 1
ScoreFlow: Mastering LLM Agent Workflows via Score-based Preference Optimization
Wang, Y., Yang, L., Li, G., Wang, M., & Aragam, B. (2025) · arXiv · doi:10.48550/arxiv.2502.04306
Evaluating Gemini in an arena for learning
LearnLM Team, Modi, A., Veerubhotla, A. S., Rysbek, A., Huber, A., Anand, A., Bhoopchand, A., Wiltshire, B., Gillick, D., Kasenberg, D., et al. (2025) · arXiv · doi:10.48550/arxiv.2505.24477
Metadata
- Authors
- Bradley, R. A., & Terry, M. E.
- Venue
- Biometrika
- Publisher
- JSTOR
- Published
- 1952-12
- Volume
- 39
- Issue
- 3/4
- Pages
- 324
- ISSN
- 0006-3444 (ISSN-L)
- OpenAlex
- W2763110165
- Cited by
- 2,412
- References
- 3
- Citations by year
- 2026: 141 · 2025: 188 · 2024: 158 · 2023: 120 · 2022: 123 · 2021: 131 · 2020: 136 · 2019: 128 · 2018: 121 · 2017: 111 · 2016: 102 · 2015: 101 · 2014: 94 · 2013: 73 · 2012: 64
- FWCI
- 3.93
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Biometrika (publishedVersion)
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Optimal Experimental Design Methods
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Applications
- Keywords
- incomplete block designs, rank analysis, rank tests, nonparametric statistics, treatment comparison
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.