Σύγκριση μεθόδων

	Μοντέλο Bradley-Terry	Μέθοδοι Συγκέντρωσης Κατατάξεων
Πεδίο	Λήψη Αποφάσεων	Λήψη Αποφάσεων
Οικογένεια	Regression model	Machine learning
Έτος προέλευσης	1952	2001
Δημιουργός	Ralph Bradley & Milton Terry	Dwork, Kumar, Naor & Sivakumar
Τύπος	Probabilistic paired comparison model	Combinatorial ranking method
Θεμελιώδης πηγή	Bradley, R. A., & Terry, M. E. (1952). Rank analysis of incomplete block designs: I. The method of paired comparisons. Biometrika, 39(3/4), 324–345.	Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. Proceedings of the 10th International Conference on World Wide Web, 613–622.
Εναλλακτικές ονομασίες	BT Model, Bradley-Terry-Luce Model, Paired Comparison Model, İkili Karşılaştırma Modeli	Rank Fusion, Order Aggregation, Preference Aggregation, Sıralama Birleştirme
Συναφείς	3	2
Σύνοψη	The Bradley-Terry model is a probabilistic model for paired comparisons that assigns a latent strength parameter to each item and predicts the probability that one item beats another in a head-to-head contest. Introduced by Ralph A. Bradley and Milton E. Terry in 1952, it provides a principled statistical framework for ranking items from pairwise preference data, including incomplete comparison designs where not every pair is directly observed.	Rank Aggregation is a family of methods that combine multiple ranked lists of alternatives into a single consensus ranking. Formally studied in the context of web search by Dwork, Kumar, Naor, and Sivakumar (2001), these methods address the problem of synthesizing divergent preference orderings from multiple sources — such as search engines, expert judges, or voter ballots — into one coherent, representative ordering that minimizes overall disagreement across the input rankings.