SearcharxivSearch

arXiv · 2410.09180

Convergence and stationary distribution of Elo rating systems

Abstract

The Elo rating system is a popular and widely adopted method for measuring the relative skill levels of players or teams in various sports and competitions. It assigns players numerical ratings and dynamically updates them based on game results and a model parameter $K$, which determines the sensitivity of rating changes. Assuming random games, this leads to a Markov chain for the evolution of the ratings of the $N$ players in the league. Despite its widespread use, little is known about the long-term behavior of this process. Aiming to fill this gap, in this article we prove that the process converges to its unique equilibrium distribution at an exponential rate in the 2-Wasserstein distance and almost surely. Moreover, we show important properties of the stationary distribution, such as the finiteness of an exponential moment, full support, and convergence to the players' true skills as $K$ decreases, at a rate of $\sqrt{K}$. We also provide Monte Carlo simulations that illustrate some of these properties and offer new insights.

Explore related subjects

Keep this discovery

BibTeXRIS

Roberto Cortez, Hagop Tossounian. 2024-10-11. Convergence and stationary distribution of Elo rating systems. https://arxiv.org/abs/2410.09180

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR