Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 97 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 35 tok/s
GPT-5 High 38 tok/s Pro
GPT-4o 102 tok/s
GPT OSS 120B 461 tok/s Pro
Kimi K2 228 tok/s Pro
2000 character limit reached

Ranking in the generalized Bradley-Terry models when the strong connection condition fails (1411.1168v1)

Published 5 Nov 2014 in stat.ME

Abstract: For nonbalanced paired comparisons, a wide variety of ranking methods have been proposed. One of the best popular methods is the Bradley-Terry model in which the ranking of a set of objects is decided by the maximum likelihood estimates (MLEs) of merits parameters. However, the existence of MLE for the Bradley-Terry model and its generalized models to allow for tied observation or home-field advantage or both to occur, crucially depends on the strong connection condition on the directed graph constructed by a win-loss matrix. When this condition fails, the MLE does not exist and hence there is no solution of ranking. In this paper, we propose an improved version of the $\varepsilon$ singular perturbation proposed by Conner and Grant (2000), to address this problem and extend it to the generalized Bradley-Terry models. Some necessary and sufficient conditions for the existence and uniqueness of the penalized MLEs for these generalized Bradley-Terry-$\varepsilon$ models are derived. Numerical studies show that the ranking is robust to the different $\varepsilon$. We apply the proposed methods to the data of the 2008 NFL regular season.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube