قارن الطرق

	نموذج بلاكيت-لوس	نموذج برادلي-تيري	طرق تجميع الرتب
المجال	اتخاذ القرار	اتخاذ القرار	اتخاذ القرار
العائلة	Regression model	Regression model	Machine learning
سنة النشأة	1975	1952	2001
صاحب الطريقة	Robin Plackett; R. Duncan Luce	Ralph Bradley & Milton Terry	Dwork, Kumar, Naor & Sivakumar
النوع	Probabilistic ranking model	Probabilistic paired comparison model	Combinatorial ranking method
المصدر التأسيسي	Plackett, R. L. (1975). The analysis of permutations. Journal of the Royal Statistical Society: Series C, 24(2), 193–202.	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.
الأسماء البديلة	Luce's Choice Axiom Model, Rank-Ordered Logit Model, Exploded Logit Model, Sıralama Tercih Modeli	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	3	2
الملخص	The Plackett-Luce model is a probabilistic framework for analysing and predicting rank-ordered data. Introduced by Robin Plackett (1975) — building on R. Duncan Luce's earlier axiom of choice (1959) — it models the probability of any complete ranking of items as a sequential selection process, where each item's chance of being chosen at each position is proportional to its latent worth parameter. It is widely used in preference learning, recommender systems, and choice modelling.	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.