Elo rating system
≈ 29 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
, the inventor of the Elo rating system The Elo rating system is a method for calculating the relative skill levels of players, originally designed for rating chess players. It is a special case of the Bradley–Terry model. The Elo system was invented as an improved chess rating system over the previously used Harkness rating system and has since been adapted for use in other zero-sum games and sports, including tennis, association football (soccer), American football, baseball, basketball, pool, various board games and esports.
It is named after its creator Arpad Elo, a Hungarian-American chess master and physics professor. The difference in the ratings between two players serves as a predictor of the outcome of a match. Two players with equal ratings who play against each other are expected to score an equal number of wins. A player whose rating is 100 points greater than their opponent's is expected to score 64%; if the difference is 200 points, then the expected score for the stronger player is 76%.
A player's Elo rating is a number that may change depending on the outcome of rated games played. After every game, the winning player takes points from the losing one. The difference between the ratings of the winner and loser determines the total number of points gained or lost after a game.…
, the inventor of the Elo rating system The Elo rating system is a method for calculating the relative skill levels of players, originally designed for rating chess players. It is a special case of the Bradley–Terry model. The Elo system was invented as an improved chess rating system over the previously used Harkness rating system and has since been adapted for use in other zero-sum games and sports, including tennis, association football (soccer), American football, baseball, basketball, pool, various board games and esports.
It is named after its creator Arpad Elo, a Hungarian-American chess master and physics professor. The difference in the ratings between two players serves as a predictor of the outcome of a match. Two players with equal ratings who play against each other are expected to score an equal number of wins. A player whose rating is 100 points greater than their opponent's is expected to score 64%; if the difference is 200 points, then the expected score for the stronger player is 76%.
A player's Elo rating is a number that may change depending on the outcome of rated games played. After every game, the winning player takes points from the losing one. The difference between the ratings of the winner and loser determines the total number of points gained or lost after a game. If the higher-rated player wins, only a few rating points (or even a fraction of a rating point) will be taken from the lower-rated player; however, if the lower-rated player scores an upset win, many rating points will be transferred.
The lower-rated player will also gain a few points from the higher-rated player in the event of a draw. This means that this rating system is self-correcting. In the long run, players whose ratings are too low or too high should do better or worse, respectively, than the rating system predicts and thus gain or lose rating points until the ratings reflect their true playing strength. Elo ratings are comparative only and are valid only within the rating pool in which they were calculated, rather than being an absolute measure of a player's strength.
While Elo-like systems are widely used in two-player settings, variations have also been applied to multiplayer competitions.
History
Arpad Elo was a chess master and an active participant in the United States Chess Federation (USCF) from its founding in 1939. The USCF used a numerical ratings system devised by Kenneth Harkness to enable members to track their individual progress in terms other than tournament wins and losses. The Harkness system was reasonably fair, but in some circumstances gave rise to ratings many observers considered inaccurate. On behalf of the USCF, Elo devised a new system with a more sound statistical basis.
At about the same time, György Karoly and Roger Cook independently developed a system based on the same principles for the New South Wales Chess Association. Elo's system replaced earlier systems of competitive rewards with one based on statistical estimation. Rating systems for many sports award points in accordance with subjective evaluations of the 'greatness' of certain achievements. For example, winning an important golf tournament might be worth an arbitrarily chosen five times as many points as winning a lesser tournament.
A statistical endeavor, by contrast, uses a model that relates the game results to underlying variables representing the ability of each player. Elo's central assumption was that the chess performance of each player in each game is a normally distributed random variable. Although a player might perform significantly better or worse from one game to the next, Elo assumed that the mean value of the performances of any given player changes only slowly over time. Elo thought of a player's true skill as the mean of that player's performance random variable.
A further assumption is necessary because chess performance in the above sense is still not measurable. One cannot look at a sequence of moves and derive a number to represent that player's skill. Performance can only be inferred from wins, draws, and losses. Therefore, a player who wins a game is assumed to have performed at a higher level than the opponent for that game. Conversely, a losing player is assumed to have performed at a lower level. If the game ends in a draw, the two players are assumed to have performed at nearly the same level.
Elo did not specify exactly how close two performances ought to be to result in a draw as opposed to a win or loss. Actually, there is a probability of a draw that is dependent on the performance differential, so this latter is more of a confidence interval than any deterministic frontier. And while he thought it was likely that players might have different standard deviations to their performances, he made a simplifying assumption to the contrary.
To simplify computation even further, Elo proposed a straightforward method of estimating the variables in his model (i.e., the true skill of each player). One could calculate relatively easily from tables how many games players would be expected to win based on comparisons of their ratings to those of their opponents. The ratings of a player who won more games than expected would be adjusted upward, while those of a player who won fewer than expected would be adjusted downward.
Moreover, that adjustment was to be in linear proportion to the number of wins by which the player had exceeded or fallen short of their expected number. From a modern perspective, Elo's simplifying assumptions are not necessary because computing power is inexpensive and widely available. Several people, most notably Mark Glickman, have proposed using more sophisticated statistical machinery to estimate the same variables. On the other hand, the computational simplicity of the Elo system has proven to be one of its greatest assets.
With the aid of a pocket calculator, an informed chess competitor can calculate to within one point what their next officially published rating will be, which helps promote a perception that the ratings are fair.
FIDE ratings
For top players, the most important rating is their FIDE rating. FIDE has issued the following lists: From 1971 to 1980, one list a year was issued. From 1981 to 2000, two lists a year were issued, in January and July. From July 2000 to July 2009, four lists a year were issued, at the start of January, April, July and October. From July 2009 to July 2012, six lists a year were issued, at the start of January, March, May, July, September and November. Since July 2012, the list has been updated monthly.
The following analysis of the July 2015 FIDE rating list gives a rough impression of what a given FIDE rating means in terms of world ranking: 5,323 players had an active rating in the range 2200 to 2299, which is usually associated with the Candidate Master title. 2,869 players had an active rating in the range 2300 to 2399, which is usually associated with the FIDE Master title. 1,420 players had an active rating between 2400 and 2499, most of whom had either the International Master or the International Grandmaster title.
542 players had an active rating between 2500 and 2599, most of whom had the International Grandmaster title. 187 players had an active rating between 2600 and 2699, all of whom had the International Grandmaster title. 40 players had an active rating between 2700 and 2799. 4 players had an active rating of over 2800. (Magnus Carlsen was rated 2853, and 3 players were rated between 2814 and 2816). The highest ever FIDE classical rating was 2882, which Carlsen has achieved twice, in May 2014 and August 2019.
Performance rating
Performance rating or special rating is a hypothetical rating that would result from the games of a single event only. Some chess organizations use the "algorithm of 400" to calculate performance rating. According to this algorithm, performance rating for an event is calculated in the following way: For each win, add your opponent's rating plus 400, For each loss, add your opponent's rating minus 400, And divide this sum by the number of played games.
Example: 2 wins (opponents & ), 2 losses (opponents & ) \begin{align} & \frac{w+400+x+400+y-400+z-400}{4} \\[6pt] & \frac{w+x+y+z+400(2)-400(2)}{4} \end{align} This can be expressed by the following formula: \text{performance rating} = \frac{\text{total of opponents' ratings } + 400 \times (\text{wins} - \text{losses})}{\text{games}} Example: If you beat a player with an Elo rating of 1000, \text{performance rating} = \frac{1000 + 400 \times (1)}{1} = 1400 If you beat two players with Elo ratings of 1000, \text{performance rating} = \frac{2000 + 400 \times (2)}{2} = 1400 If you draw, \text{performance rating} = \frac{1000 + 400 \times (0)}{1} = 1000 This is a simplification, but it offers an easy way to get an estimate of PR (performance rating).
FIDE, however, calculates performance rating by means of the formula \text{performance rating} = \text{average of opponents' ratings} + d_p, where "rating difference" d_p is based on a player's tournament percentage score p , which is then used as the key in a lookup table where p is simply the number of points scored divided by the number of games played. Note that, in case of a perfect or no score d_p is 800.
Live ratings
FIDE updates its ratings list at the beginning of each month. In contrast, the unofficial "Live ratings" calculate the change in players' ratings after every game. These Live ratings are based on the previously published FIDE ratings, so a player's Live rating is intended to correspond to what the FIDE rating would be if FIDE were to issue a new list that day. Although Live ratings are unofficial, interest arose in Live ratings in August/September 2008 when five different players took the "Live" No. 1 ranking.
The unofficial live ratings of players over 2700 were published and maintained by Hans Arild Runde at the Live Rating website until August 20111. Another website, 2700chess.com, has been maintained since May 2011 by Artiom Tsepotan, which covers the top 100 players as well as the top 50 female players. Rating changes can be calculated manually by using the FIDE ratings change calculator. All top players have a K-factor of 10, which means that the maximum ratings change from a single game is a little less than 10 points.
The K-factor used by the USCF
The K-factor, in the USCF rating system, can be estimated by dividing 800 by the effective number of games a player's rating is based on ( ) plus the number of games the player completed in a tournament ( ): K = \frac{800}{N_e + m}.
Rating floors
The USCF maintains an absolute rating floor of 100 for all ratings. Thus, no member can have a rating below 100, no matter their performance at USCF-sanctioned events. However, players can have higher individual absolute rating floors, calculated using the formula \mathrm{AF} = \min \{100 + 4 N_\text{W} + 2 N_\text{D} + N_\text{R}, 150\}, where N_\text{W} is the number of rated games won, N_\text{D} is the number of rated games drawn, and N_\text{R} is the number of events in which the player completed three or more rated games.
Higher rating floors exist for experienced players who have achieved significant ratings. Such higher rating floors exist, starting at ratings of 1200 in 100-point increments up to 2100 (1200, 1300, 1400, ..., 2100). A rating floor is calculated by taking the player's peak established rating, subtracting 200 points, and then rounding down to the nearest rating floor. For example, a player who has reached a peak rating of 1464 would have a rating floor of , which would be rounded down to 1200.
Under this scheme, only Class C players and above are capable of having a higher rating floor than their absolute player rating. All other players would have a floor of at most 150. There are two ways to achieve higher rating floors other than under the standard scheme presented above. If a player has achieved the rating of Original Life Master, their rating floor is set at 2200. The achievement of this title is unique in that no other recognized USCF title will result in a new floor.
For players with ratings below 2000, winning a cash prize of $2,000 or more raises that player's rating floor to the closest 100-point level that would have disqualified the player for participation in the tournament. For example, if a player won $4,000 in a 1750-and-under tournament, they would now have a rating floor of 1800.
Theory
Pairwise comparisons form the basis of the Elo rating methodology. Elo made references to the papers of Good, David, Trawinski and David, and Buhlman and Huber. E_A = \frac{1}{1 + 10^{(R_B - R_A)/400}}. Similarly, the expected score for player is E_B = \frac{1}{1 + 10^{(R_A - R_B)/400}}. This could also be expressed by E_A = \frac{Q_A}{Q_A + Q_B} and E_B = \frac{Q_B}{Q_A + Q_B}, where Q_A = 10^{R_A/400} and Q_B = 10^{R_B/400}. Note that in the latter case, the same denominator applies to both expressions, and it is plain that E_A + E_B = 1.
This means that by studying only the numerators, we find out that the expected score for player is Q_A/Q_B times the expected score for player . We can calculate this ratio from as . It then follows that for each 400 rating points of advantage over the opponent, the expected score is magnified ten times in comparison to the opponent's expected score. When a player's actual tournament scores exceed their expected scores, the Elo system takes this as evidence that player's rating is too low, and needs to be adjusted upward.
Similarly, when a player's actual tournament scores fall short of their expected scores, that player's rating is adjusted downward. Elo's original suggestion, which is still widely used, was a simple linear adjustment proportional to the amount by which a player over-performed or under-performed their expected score. The maximum possible adjustment per game, called the K-factor, was set at K = 16 for masters and K = 32 for weaker players. Suppose player (again with rating R_A ) was expected to score E_A points but actually scored S_A points.
The formula for updating that player's rating is R_A' = R_A + K \cdot (S_A - E_A). This update can be performed after each game or each tournament, or after any suitable rating period. An example may help to clarify: This updating procedure is at the core of the ratings used by FIDE, USCF, Yahoo! Games, the Internet Chess Club (ICC) and the Free Internet Chess Server (FICS).
However, each organization has taken a different approach to dealing with the uncertainty inherent in the ratings, particularly the ratings of newcomers, and to dealing with the problem of ratings inflation/deflation. New players are assigned provisional ratings, which are adjusted more drastically than established ratings. The principles used in these rating systems can be used for rating other competitions—for instance, international football matches.
Elo ratings have also been applied to games without the possibility of draws, and to games in which the result can also have a quantity (small/big margin) in addition to the quality (win/loss). See Go rating with Elo for more. The second major concern is the correct " -factor" used. The chess statistician Jeff Sonas believes that the original K = 10 value (for players rated above 2400) is inaccurate in Elo's work.
If the -factor coefficient is set too large, there will be too much sensitivity to just a few, recent events, in terms of a large number of points exchanged in each game. And if the K-value is too low, the sensitivity will be minimal, and the system will not respond quickly enough to changes in a player's actual level of performance. Elo's original -factor estimation was made without the benefit of huge databases and statistical evidence.
Sonas indicates that a -factor of 24 (for players rated above 2400) may be both more accurate as a predictive tool of future performance and be more sensitive to performance. Certain Internet chess sites seem to avoid a three-level K-factor staggering based on rating range. For example, the ICC seems to adopt a global except when playing against provisionally rated players.
The USCF (which makes use of a logistic distribution as opposed to a normal distribution) formerly staggered the K-factor according to three main rating ranges: K = 32 : below 2100 K = 24 : between 2100 and 2400 K = 16 : above 2400 Currently, the USCF uses a formula that calculates the -factor based on factors including the number of games played and the player's rating. The K-factor is also reduced for high rated players if the event has shorter time controls.
FIDE uses the following ranges: K = 40 : for a player new to the rating list until the completion of events with a total of 30 games, and for all players until their 18th birthday, as long as their rating remains under 2300 K = 20 : for players who have always been rated under 2400 K = 10 : for players with any published rating of at least 2400 and at least 30 games played in previous events.
Thereafter it remains permanently at 10 FIDE used the following ranges before July 2014: K = 30 (was 25): for a player new to the rating list until the completion of events with a total of 30 games K = 15 : for players who have always been rated under 2400 K = 10 : for players with any published rating of at least 2400 and at least 30 games played in previous events.
Thereafter it remains permanently at 10 The gradation of the -factor reduces rating change at the top end of the rating range, reducing the possibility for rapid rise or fall of rating for those with a rating high enough to reach a low -factor.
In theory, this might apply equally to online chess players and over-the-board players, since it is more difficult for all players to raise their rating after their rating has become high and their -factor consequently reduced; however, when playing online, players rated over 2800 can more easily raise their rating by simply selecting opponents with high ratings on the ICC playing site, a grandmaster may play a string of different opponents who are all rated over 2700.
In over-the-board events, it would only be in very high level all-play-all events that a player would be able to engage that number of opponents rated over 2700.
In a normal, open, Swiss-paired chess tournament, frequently there would be many opponents rated less than 2500, reducing the ratings gains possible from a single contest for a high-rated player. \Pr\{\mathsf{A}~\textrm{wins}\} = \sigma(r_{\mathsf{A,B}}), \quad \sigma(r)=\frac 1 {1 + 10^{-r/s}}, where r_{\mathsf{A,B}} = (R_\mathsf{A} - R_\mathsf{B}) denotes the difference of the players' ratings, and we use a scaling factor s=400 , and, by law of total probability \Pr\{\mathsf{B}~\textrm{wins}\} = 1-\sigma(r_{\mathsf{A,B}})=\sigma(-r_{\mathsf{A,B}}).
The log loss is then calculated as \ell = \begin{cases} -\log \sigma(r_\mathsf{A,B}) & \textrm{if}~ \mathsf{A}~\textrm{wins},\\ -\log \sigma(-r_\mathsf{A,B}) & \textrm{if}~ \mathsf{B}~\textrm{wins}, \end{cases} and, using the stochastic gradient descent the log loss is minimized as follows: R_{\mathsf{A}}\leftarrow R_{\mathsf{A}} - \eta \frac{\textrm{d}\ell}{\textrm{d} R_{\mathsf{A}}} , R_{\mathsf{B}}\leftarrow R_{\mathsf{B}} - \eta \frac{\textrm{d}\ell}{\textrm{d} R_{\mathsf{B}}} . where \eta is the adaptation step.
Since \frac{\textrm{d}}{\textrm{d} r}\log\sigma(r)=\frac{\log 10}{s}\sigma(-r) , \frac{\textrm{d} r_{\mathsf{A,B}}}{\textrm{d} R_{\mathsf{A}}}=1 , and \frac{\textrm{d} r_{\mathsf{A,B}}}{\textrm{d} R_{\mathsf{B}}}=-1 , the adaptation is then written as follows R_{\mathsf{A}}\leftarrow \begin{cases} R_{\mathsf{A}} + K \sigma(-r_{\mathsf{A,B}}) & \textrm{if}~\mathsf{A}~\textrm{wins}\\ R_{\mathsf{A}} - K \sigma(r_{\mathsf{A,B}}) & \textrm{if}~\mathsf{B}~\textrm{wins}, \end{cases} which may be compactly written as R_{\mathsf{A}}\leftarrow R_{\mathsf{A}} + K (S_{\mathsf{A}}-E_{\mathsf{A}}) where K=\eta\log10/s is the new adaptation step which absorbs \eta and s , S_{\mathsf{A}}=1 if \mathsf{A} wins and S_{\mathsf{A}}=0 if \mathsf{B} wins, and the expected score is given by E_{\mathsf{A}}=\sigma(r_{\mathsf{A,B}}) .
Analogously, the update for the rating R_{\mathsf{B}} is R_{\mathsf{B}}\leftarrow R_{\mathsf{B}} + K (S_{\mathsf{B}}-E_{\mathsf{B}}) . Since the very beginning, the Elo rating has been also used in chess where we observe wins, losses or draws and, to deal with the latter a fractional score value, S_{\mathsf{A}}=0.5 , is introduced. We note, however, that the scores S_{\mathsf{A}}=1 and S_{\mathsf{A}}=0 are merely indicators to the events when the player \mathsf{A} wins or loses the game.
It is, therefore, not immediately clear what is the meaning of the fractional score. Moreover, since we do not specify explicitly the model relating the rating values R_{\mathsf{A}} and R_{\mathsf{B}} to the probability of the game outcome, we cannot say what the probability of the win, the loss, or the draw is. To address these difficulties, and to derive the Elo rating in the ternary games, we will define the explicit probabilistic model of the outcomes. Next, we will minimize the log loss via stochastic gradient.
Since the loss, the draw, and the win are ordinal variables, we should adopt the model which takes their ordinal nature into account, and we use the so-called adjacent categories model which may be traced to the Davidson's work \Pr\{\mathsf{A}~\textrm{wins}\} = \sigma(r_{\mathsf{A,B}}; \kappa), \Pr\{\mathsf{B}~\textrm{wins}\} = \sigma(-r_{\mathsf{A,B}}; \kappa), \Pr\{\mathsf{A}~\textrm{draws}\} = \kappa\sqrt{\sigma(r_{\mathsf{A,B}}; \kappa)\sigma(-r_{\mathsf{A,B}}; \kappa)}, where \sigma(r; \kappa) = \frac{10^{r/s}}{10^{-r/s}+\kappa + 10^{r/s}} and \kappa\ge 0 is a parameter.
Introduction of a free parameter should not be surprising as we have three possible outcomes and thus, an additional degree of freedom should appear in the model. In particular, with \kappa=0 we recover the model underlying the logistic regression \Pr\{\mathsf{A}~\textrm{wins}\} = \sigma(r_{\mathsf{A,B}};0)=\frac{10^{r_{\mathsf{A,B}}/s}}{10^{-r_{\mathsf{A,B}}/s}+ 10^{r_{\mathsf{A,B}}/s}}=\frac{1}{1+ 10^{-r_{\mathsf{A,B}}/s'}}, where s' = s/2 .
Using the ordinal model defined above, the log loss is now calculated as \ell = \begin{cases} -\log \sigma(r_{\mathsf{A,B}};\kappa) & \textrm{if}~ \mathsf{A}~\textrm{wins},\\ -\log \sigma(-r_{\mathsf{A,B}};\kappa) & \textrm{if}~ \mathsf{B}~\textrm{wins},\\ -\log \kappa -\frac{1}{2}\log\sigma(r_{\mathsf{A,B}};\kappa) - \frac{1}{2}\log\sigma(-r_{\mathsf{A,B}};\kappa) & \textrm{if}~ \mathsf{A}~\textrm{draw}, \end{cases} which may be compactly written as \ell = -(S_{\mathsf{A}} +\frac{1}{2}D)\log \sigma(r_{\mathsf{A,B}};\kappa) -(S_{\mathsf{B}} +\frac{1}{2}D) \log \sigma(-r_{\mathsf{A,B}};\kappa) -D\log \kappa where S_{\mathsf{A}}=1 iff \mathsf{A} wins, S_{\mathsf{B}}=1 iff \mathsf{B} wins, and D=1 iff \mathsf{A} draws.
As before, we need the derivative of \log\sigma(r;\kappa) which is given by \frac{\textrm{d}}{\textrm{d} r}\log\sigma(r; \kappa) =\frac{2\log 10}{s} [1-g(r;\kappa)] , where g(r;\kappa)= \frac{10^{r/s}+\kappa/2 } {10^{-r/s}+\kappa + 10^{r/s}}.
Thus, the derivative of the log loss with respect to the rating R_{\mathsf{A}} is given by \begin{align} \frac{\textrm{d}}{\textrm{d} R_{\mathsf{A}}}\ell &= -\frac{2\log 10}{s} \left( (S_{\mathsf{A}} +0.5D)[1-g(r_{\mathsf{A,B}};\kappa)] -(S_{\mathsf{B}} +0.5D)g(r_{\mathsf{A,B}};\kappa) \right)\\ &= -\frac{2\log 10}{s} \left(S_{\mathsf{A}} + 0.5D-g(r_{\mathsf{A,B}};\kappa)\right), \end{align} where we used the relationships S_{\mathsf{A}} + S_{\mathsf{B}} + D=1 and g(-r;\kappa)=1-g(r;\kappa) .
Then, the stochastic gradient descent applied to minimize the log loss yields the following update for the rating R_{\mathsf{A}} R_{\mathsf{A}}\leftarrow R_{\mathsf{A}} + K (\hat{S}_{\mathsf{A}}- g(r_{\mathsf{A,B}};\kappa)) where K=2\eta\log10/s and \hat{S}_{\mathsf{A}}= S_{\mathsf{A}} + 0.5D . Of course, \hat{S}_{\mathsf{A}}= 1 if \textsf{A} wins, \hat{S}_{\mathsf{A}}= 0.5 if \textsf{A} draws, and \hat{S}_{\mathsf{A}}= 0 if \textsf{A} loses. To recognize the origin in the model proposed by Davidson, this update is called an Elo-Davidson rating.
The update for R_{\mathsf{B}} is derived in the same manner as R_{\mathsf{B}}\leftarrow R_{\mathsf{B}} + K (\hat{S}_{\mathsf{B}}- g(r_{\mathsf{B,A}};\kappa)) , where r_{\mathsf{B,A}}=R_{\mathsf{B}}-R_{\mathsf{A}}=-r_{\mathsf{A,B}} .
We note that \begin{align} E[\hat{S}_{\mathsf{A}}] &=\Pr\{\mathsf{A}~\text{wins}\}+0.5\Pr\{\mathsf{A}~\text{draws}\}\\ &=\sigma(r_{\mathsf{A,B}};\kappa)+0.5\kappa\sqrt{\sigma(r_{\mathsf{A,B}};\kappa)\sigma(-r_{\mathsf{A,B}};\kappa)}\\ &=g(r_{\mathsf{A,B}};\kappa) \end{align} and thus, we obtain the rating update may be written as R_{\mathsf{A}}\leftarrow R_{\mathsf{A}} + K (\hat{S}_{\mathsf{A}}- E_{\mathsf{A}}) , where E_{\mathsf{A}}=E[\hat{S}_\mathsf{A}] and we obtained practically the same equation as in the Elo rating except that the expected score is given by E_{\mathsf{A}}=g(r_{\mathsf{A,B}};\kappa) instead of E_{\mathsf{A}}=\sigma(r_{\mathsf{A,B}}) .
As noted above, for \kappa=0 , we have g(r;0) = \sigma(r) and thus the Elo-Davidson rating is exactly the same as the Elo rating; however, this is of no help to understand the case when the draws are observed (we cannot use \kappa=0 which would mean that the probability of draw is null). On the other hand, if we use \kappa=2 , we have g(r;2)= \frac{10^{r/s}+1 } {10^{-r/s}+2 + 10^{r/s}}=\frac{1} {1+10^{-r/s}}=\sigma(r) which means that, using \kappa=2 , the Elo-Davidson rating is exactly the same as the Elo rating.
Combating deflation
Because of the significant difference in timing of when inflation and deflation occur, and in order to combat deflation, most implementations of Elo ratings have a mechanism for injecting points into the system in order to maintain relative ratings over time. FIDE has two inflationary mechanisms. First, performances below a "ratings floor" are not tracked, so a player with true skill below the floor can only be unrated or overrated. Second, established and higher-rated players have a lower K-factor.
New players have a , which drops to after 30 played games, and to when the player reaches 2400. The current system in the United States includes a bonus point scheme which feeds rating points into the system in order to track improving players, and different K-values for different players. Some methods, used in Norway for example, differentiate between juniors and seniors, and use a larger K-factor for the young players, even boosting the rating progress by 100% for when they score well above their predicted performance.
Rating floors in the United States work by guaranteeing that a player will never drop below a certain limit. This also combats deflation, but the chairman of the USCF Ratings Committee has been critical of this method because it does not feed the extra points to the improving players. A possible motive for these rating floors is to combat sandbagging, i.e., deliberate lowering of ratings to be eligible for lower rating class sections and prizes.
Ratings of computers
Human–computer chess matches between 1997 (Deep Blue versus Garry Kasparov) and 2006 demonstrated that chess computers are capable of defeating even the strongest human players. By 2023, computers had achieved Elo ratings over 3500, based on data from chess.com and SSDF. However, chess engine ratings are difficult to quantify or compare to human ratings, due to variable factors such as the time control and the hardware the program runs on, and also the fact that chess is not a fair game between first and second players.
Published engine rating lists such as CCRL are based on engine-only games on standard hardware configurations and are not directly comparable to FIDE ratings. For some other ratings estimates, see Chess engine § Ratings. The existence and magnitude of the first-move advantage in chess becomes very important at the computer level.
Beyond some skill threshold, an engine with White should be able to force a draw on demand from the starting position even against perfect play, simply because White begins with too big an advantage to lose compared to the small magnitude of the errors it is likely to make. Consequently, such an engine is more or less guaranteed to score at least 25% even against perfect play.
Differences in skill beyond a certain point could only be picked up if one does not begin from the usual starting position, but instead chooses a starting position that is only barely not lost for one side. Because of these factors, ratings depend on pairings and the openings selected.
Other usage
The Elo rating system has been used in soft biometrics, which concerns the identification of individuals using human descriptions. Comparative descriptions were utilized alongside the Elo rating system to provide robust and discriminative 'relative measurements', permitting accurate identification. The Elo rating system has been used in biology for assessing male dominance hierarchies, and in automation and computer vision for fabric inspection. Moreover, online judge sites are using the Elo rating system or its derivatives.
For example, Topcoder is using a modified version based on normal distribution, while Codeforces is using another version based on logistic distribution. The Elo rating system has been noted in dating apps, such as in the matchmaking app Tinder, which uses a variant of the Elo rating system. The YouTuber Marques Brownlee and his team used the Elo rating system when they let people vote between digital photos taken with different smartphone models launched in 2022.
The Elo rating system has been used in U.S. revealed preference college rankings, such as those by the digital credential firm Parchment.
References in the media
The Elo rating system was featured prominently in the 2010 film The Social Network during the algorithm scene where Mark Zuckerberg released Facemash. In the scene Eduardo Saverin writes mathematical formulas for the Elo rating system on Zuckerberg's dormitory room window. Behind the scenes, the movie claims, the Elo system is employed to rank girls by their attractiveness. The equations driving the algorithm are shown briefly, written on the window; however, they are slightly incorrect.
See also
Elo hell Rating percentage index (RPI), another system that incorporates strength of opponents
Notes
References
Further reading
Text derived from https://en.wikipedia.org/w/index.php?oldid=1377743404 under CC BY-SA 4.0; modifications have been made.
References
- ↩Wikipedia “Elo rating system” publication date (×1) · confidence 0.95 revision URL