## Abstract

From the viewpoint of networks, a ranking system for players or teams in sports is equivalent to a centrality measure for sports networks, whereby a directed link represents the result of a single game. Previously proposed network-based ranking systems are derived from static networks, i.e., aggregation of the results of games over time. However, the score of a player (or team) fluctuates over time. Defeating a renowned player in the peak performance is intuitively more rewarding than defeating the same player in other periods. To account for this factor, we propose a dynamic variant of such a network-based ranking system and apply it to professional men's tennis data. We derive a set of linear online update equations for the score of each player. The proposed ranking system predicts the outcome of the future games with a higher accuracy than the static counterparts.

## Introduction

Ranking of individual players or teams in sports, both professional and amateur, is a tool for entertaining fans and developing sports business. Depending on the type of sports, different ranking systems are in use^{1}. A challenge in sports ranking is that it is often impossible for all the pairs of players or teams (we refer only to players in the following. However, the discussion also applies to team sports) to fight against each other. This is the case for most individual sports and some team sports in which a league contains many teams, such as American college football and soccer at an international level. Then, the set of opponents depends on players such that ranking players by simply counting the number of wins and losses is inappropriate.

In this situation, several ranking systems on the basis of networks have been proposed. A player is regarded to be a node in a network, and a directed link from the winning player to the losing player (or the converse) represents the result of a single game. Once the directed network of players is generated, ranking the players is equivalent to defining a centrality measure for the network. A crux in constructing a network-based ranking system is to let a player that beats a strong player gain a high score. Examples of network-based ranking systems include those derived from the Laplacian matrix of the network^{2,3,4,5}, the PageRank^{6}, a random walk that is different from those implied by the Laplacian or PageRank^{7}, a combination of node degree and global structure of networks^{8}, and the so-called win-lose score^{9}.

Previous network-based ranking systems do not account for fluctuations of rankings. In fact, a player, even a history making strong player, referred to as *X*, is often weak in the beginning of the career. Player *X* may also be weak past the most brilliant period in the *X*'s career, suggestive of the retirement in a near future. For other players, it is more rewarding to beat *X* when *X* is in the peak performance than when *X* is novice, near the retirement, or in the slump. It may be preferable to take into account the dynamics of players' strengths for defining a ranking system. In the present study, we extend the win-lose score, a network-based ranking system proposed by Park and Newman^{9} to the dynamical case. Then, we apply the proposed ranking system to the professional men's tennis data.

In broader contexts, the current study is related to at least two other lineages of researches. First, a dynamic network-based ranking implies that we exploit the temporal information about the data, i.e., the times when games are played. Therefore, such a ranking system is equivalent to a dynamic centrality measure for temporal networks, in which sequences of pairwise interaction events with time stamps are building units of the network^{10}. Although some centrality measures specialized in temporal networks have been proposed^{11,12,13}, they are not for ranking purposes. In addition, they are constant valued centrality measures for dynamic (i.e., temporal) data of pairwise interaction. In the context of temporal networks, we propose a dynamically changing centrality measure for temporal networks.

Second, statistical approaches to sports ranking have a much longer history than network approaches. Representative statistical ranking systems include the Elo system^{14} and the Bradley-Terry model (see ref. 15 for a review). Variants of these models have been used to construct dynamic ranking systems. Empirical Bayes framework naturally fits this problem^{16,17,18,19,20,21}. Because the Bayesian estimators cannot be obtained analytically, or even numerically owing to the computational cost, in these models, techniques for obtaining Bayes estimators such as the Gaussian assumption of the posterior distribution^{18,21}, approximate message passing^{21}, and Kalman filter^{17,18,19}, have been employed. In a non-Bayesian statistical ranking system, the pseudo likelihood, which is defined such that the contribution of the past game results to the current pseudo likelihood decays exponentially in time, is numerically maximized^{22}.

In general, the parameter set of a statistical ranking system that accounts for dynamics of players' strengths is composed of dynamically changing strength parameters for all the players and perhaps other auxiliary parameters. Therefore, the number of parameters to be statistically estimated may be large relative to the amount of data. In other words, the instantaneous ranks of players have to be estimated before the players play sufficiently many games with others under fixed strengths. Even under a Bayesian framework with which updating of the parameter values is naturally implemented, it may be difficult to reliably estimate dynamic ranks of players due to relative paucity of data. In addition, in sports played by individuals, such as tennis, it frequently occurs that new players begin and old and underperforming players leave. This factor also increases the number of parameters of a ranking system. In contrast, ours and other network-based ranking systems, both static and dynamic ones, are not founded on statistical methods. Network-based ranking systems can be also simpler and more transparent than statistical counterparts.

## Results

### Dynamic win-lose score

We extend the win-lose score^{9} (see Methods) to account for the fact that the strengths of players fluctuate over time. In the following, we refer to the win-lose score as the original win-lose score and the extended one as the dynamic win-lose score.

The original win-lose score overestimates the real strength of a player *i* when *i* defeated an opponent *j* that is now strong and was weak at the time of the match between *i* and *j*. Because *j* defeats many strong opponents afterward, *i* unjustly receives many indirect wins through *j*. The same logic also applies to other network-based static ranking systems^{2,3,4,5,6,7,8}.

To remedy this feature, we pose two assumptions. First, we assume that the increment of the win score of player *i* through the *i*'s winning against player *j* depends on the *j*'s win score at that moment. It does not explicitly depend on the *j*'s score in the past or future. The same holds true for the lose score. Second, we assume that each player's win and lose scores decay exponentially in time. This assumption is also employed in a Bayesian dynamic ranking system^{22}.

Let be the win-lose matrix for the game that occurs at time *t _{n}* (1 ≤

*n*≤

*n*

_{max}). In the analysis of the tennis data carried out in the following, the resolution of

*t*is equal to one day. Therefore, players' scores change even within a single tournament. If player

_{n}*j*wins against player

*i*at time

*t*, we set the (

_{n}*i*,

*j*) element of the matrix to be 1. All the other elements of are set to 0. We define the dynamic win score at time

*t*in vector form, denoted by , as follows:

_{n}and where *α* is the weight of the indirect win, which is the same as the case of the original win-lose score (Methods), and *β* ≥ 0 represents the decay rate of the score.

The first term on the right-hand side of Eq. (1) (i.e., ) represents the effect of the direct win at time *t _{n}*. The second term consists of two contributions. For

*m*= 0, the quantity inside the summation represents the direct win at time

_{n}*t*

_{n}_{−1}, which results in weight . For

*m*= 1, the quantity represents the indirect win. The (

_{n}*i*,

*j*) element of is positive if and only if player

*j*wins against a player

*k*at time

*t*and

_{n}*k*wins against

*i*at time

*t*

_{n}_{−1}. Player

*i*gains score out of this situation. For both cases

*m*= 0 and

_{n}*m*= 1, the

_{n}*j*th column of the second term accounts for the effect of the

*j*'s win at time

*t*

_{n}_{−1}. The third term covers four cases. For

*m*

_{n}_{−1}=

*m*= 0, the quantity inside the summation represents the direct win at

_{n}*t*

_{n}_{−2}, resulting in weight . For

*m*

_{n}_{−1}= 0 and

*m*= 1, the quantity represents the indirect win based on the games at

_{n}*t*

_{n}_{−2}and

*t*, resulting in weight . For

_{n}*m*

_{n}_{−1}= 1 and

*m*= 0, the quantity represents the indirect win based on the games at

_{n}*t*

_{n}_{−2}and

*t*

_{n}_{−1}, resulting in weight . For

*m*

_{n}_{−1}=

*m*= 1, the quantity represents the indirect win based on the games at

_{n}*t*

_{n}_{−2},

*t*

_{n}_{−1}, and

*t*, resulting in weight . In either of the four cases, the

_{n}*j*th column of the third term accounts for the effect of the

*j*'s win at time

*t*

_{n}_{−2}.

To see the difference between the original and dynamic win scores, consider the exemplary data with *N* = 3 players shown in Fig. 1. The original win-lose scores calculated from the aggregation of the data up to time *t _{n}* (

*n*= 1, 2, and 3), denoted by ${w}_{{t}_{n}}$ (i) for player i, are given by The scores of the three players are the same at

*t*=

*t*

_{3}because the aggregated network is symmetric (i.e., directed cycle) if we discard the information about the time.

The dynamic win-lose scores for the same data are given by The score of player 1 at *t*_{2} (i.e., ${w}_{{t}_{2}}$(1)) differs from the original win-lose score in two aspects. First, it is discounted by factor . Second, the value of ${w}_{{t}_{2}}$(1) indicates that player 1 does not gain an indirect win. This is because it is after player 1 defeated player 2 that player 2 defeats player 3. In contrast, player 3 gains an indirect win at *t* = *t*_{3} because player 3 defeats player 1, which defeated player 2 before (i.e., at *t* = *t*_{1}). It should be noted that the win scores of the three players are different at *t* = *t*_{3} although the aggregated network is symmetric.

Equation (1) leads to Therefore, by combining Eqs. (2) and (5), we obtain the update equation for the dynamic win score as follows:The dynamic lose score at time *t _{n}* is denoted in vector form by . We obtain the update equation for by replacing in Eq. (6) by as follows:Finally, the dynamic win-lose score at time

*t*, denoted by , is given byIt should be noted that we do not treat retired players in special ways. Players' scores exponentially decay after retirement.

_{n}### Predictability

We apply the dynamic win-lose score to results of professional men's tennis. The nature of the data is described in Methods.

In this section, we predict the outcomes of future games based on different ranking systems. The frequency of violations, whereby a lower ranked player wins against a higher ranked player in a game, quantifies the degree of predictability^{24,25}. In other literature, the retrodictive version of the frequency of violations is also used for assessing the performance of ranking systems^{24,26,27,28}.

We compare the predictability of the dynamic win-lose score, the original win-lose score^{9}, and the prestige score (Methods). The prestige score, proposed by Radicchi and applied to professional men's tennis data^{6}, is a static ranking system and is a version of the PageRank originally proposed for ranking webpages^{29}. We also implement a dynamic version of the prestige score (Methods) and compare its performance of prediction with that of the dynamic win-lose score.

We define the frequency of violations as follows. We calculate the score of each player at *t _{n}* (1 ≤

*n*≤

*n*

_{max}− 1) on the basis of the results up to

*t*. For the original win-lose score and prestige score, we aggregate the directed links from

_{n}*t*=

*t*

_{1}to

*t*=

*t*to construct a static network and calculate the players' scores. If the result of each game at

_{n}*t*

_{n}_{+1}is inconsistent with the calculated ranking, we regard that a violation occurs. If the two players involved in the game at

*t*

_{n}_{+1}have exactly the same score, we regard that a tie occurs irrespective of the result of the game. We define the prediction accuracy at the

*N*

_{gp}th game as the fraction of correct prediction when the results of the games from

*t*=

*t*

_{2}through the

*N*

_{gp}th game are predicted. The prediction accuracy is given by , where is the number of predicted games,

*v*is the number of violations, and

*e*is the number of ties.

For the prestige score and its dynamic variant, we exclude the games in which either player plays for the first time because the score is not defined for the players that have never played. In this case, we increment *e* by one.

The original and dynamic win-lose scores can be negative valued. Equations (2) and (12) guarantee that the initial score is equal to zero for all the players for the dynamic and original win-lose scores, respectively. Furthermore, any player has a zero win-lose score when the player fights a game for the first time. Even though we do not treat such a game as tie unless both players involved in the game have zero scores, treating it as tie little affects the following results.

The prediction accuracy for the dynamic win-lose score, original win-lose score, prestige score, and dynamic prestige score are shown in Figs. 2(a), 2(b), 2(c), and 2(d), respectively, for various parameter values.

Figure 2(a) indicates that the prediction accuracy for the dynamic win-lose score is the largest for *α* = 0.13 except when the number of games (i.e., *N*_{gp}) is small. The accuracy is insensitive to *α* when 0.08 ≤ *α* ≤ 0.2. In this range of *α*, we confirmed by additional numerical simulations that the results for *β* = 1/365 and those for *β* = 0 are indistinguishable. Therefore, we conclude that the performance of prediction has some robustness with respect to *α* and *β*. We also confirmed that the accuracy monotonically increases between *α* ≈ 0.03 and *α* ≈ 0.13. However, for an unknown reason, the accuracy with *α* ≈ 0.03 is smaller than that with *α* = 0 (results not shown).

Figure 2(b) indicates that the prediction accuracy for the original win-lose score is larger for *α* = 0 than *α* = 0.004835. The latter *α* value is very close to the upper limit calculated from the largest eigenvalue of *A* (see subsection “Parameter values” in Methods). We also found that the prediction accuracy monotonically decreases with *α*. Nevertheless, except for small *N*_{gp}, the accuracy with *α* = 0 is lower than that for the dynamic win-lose score with *α* = 0 and 0.08 ≤ *α* ≤ 0.2 (Fig. 2(a)).

Figure 2(c) indicates that the prediction by the prestige score is better for a smaller value of *q* (see Methods for the meaning of *q*). We confirmed that this is the case for other values of *q* and that the results with *q* ≤ 0.05 little differ from those with *q* = 0.05. Except for small *N*_{gp}, the prediction accuracy with *q* = 0.05 is lower than that for the dynamic win-lose score with 0.08 ≤ *α* ≤ 0.2 (Fig. 2(a)).

Figure 2(d) indicates that the prediction by the dynamic variant of the prestige score is more accurate than that by the dynamic win-lose score, in particular for small *N*_{gp}. Similar to the case of the original prestige score, the prediction accuracy decreases with *q*.

The findings obtained from Fig. 2 are summarized as follows. When *α* is between ≈ 0.08 and ≈ 0.2 and *β* is between 0 and 1/365, the dynamic win-lose score outperforms the original win-lose score and the prestige score in the prediction accuracy. For example, at the end of the data, the accuracy is equal to 0.659, 0.661, 0.661, and 0.659 for the dynamic win-lose score with (*α*, *β*) = (0.08, 1/365), (0.1, 1/365), (0.13, 1/365), and (0.2, 1/365), respectively, while it is equal to 0.623 for the original win-lose score with *α* = 0 and 0.631 for the prestige score with *q* = 0.05. However, the accuracy for the dynamic variant of the prestige score with *q* = 0.05 (i.e., 0.668) is slightly larger than the largest value obtained by the dynamic win-lose score.

We also compare the prediction accuracy for the dynamic win-lose score with that for the official Association of Tennis Professionals (ATP) rankings. Because the calculation of the ATP rankings involves relatively minor games that do not belong to ATP World Tour tournaments, which we used for Fig. 2, we use a different data set for the present comparison (see “Data” in Methods). The prediction accuracy at the end of the data is equal to 0.637 for the ATP rankings and 0.588, 0.629, 0.646, 0.650, and 0.649 for the dynamic win-lose score with (*α*, *β*) = (0.08, 1/365), (0.1, 1/365), (0.13, 1/365), (0.17, 1/365), and (0.2, 1/365), respectively. The prediction accuracy for the dynamic win-lose score is larger than that for the ATP rankings in a wide range of *α* (i.e., 0.11 ≤ *α* ≤ 0.39).

### Robustness against parameter variation

Figure 2(a) indicates that the prediction accuracy for the dynamic win-lose score is robust against some variations in the *α* and *β* values. In this section, we examine the robustness of the dynamic win-lose score more extensively by examining the rank correlation between the scores derived from different *α* and *β* values.

The Kendall's tau is a standard method to quantify the rank correlation^{30}. In our data, the full ranking containing all the players, to which the Kendall's tau applies, contains players that only appear in a few games. In fact, most players are such players^{6}, and their ranks are inherently unstable. In addition, it is usually the list of top ranked players that are of practical interests.

Therefore, we use a generalized Kendall's tau for comparing top *k* lists of the full ranking^{31}. We denote the sets of the top *k* players, i.e., *k* players with the largest scores, in the two full rankings by *R*_{1} and *R*_{2}. In general, *R*_{1} and *R*_{2} can be different. For an arbitrarily chosen pair of players *r*_{1}, *r*_{2} ∈ *R*_{1} ∪ *R*_{2}, *r*_{1} ≠ *r*_{2}, we set if (1) *r*_{1} and *r*_{2} appear in both top *k* lists *R*_{1} and *R*_{2}, and *r*_{1} and *r*_{2} are in the opposite order in the two top *k* lists, (2) *r*_{1} has a higher rank than *r*_{2} in one of the top *k* lists, and *r*_{2}, but not *r*_{1}, is contained in the other top *k* list, (3) *r*_{1} exists only in one of the two top *k* lists, and *r*_{2} exists only in the other top *k* list. Otherwise, we set . is a penalty imposed on the inconsistency between the two top *k* lists. We use the so-called optimistic variant of the Kendall distance defined as follows^{31}:We normalize the distance between the two rankings as follows^{32}:A large value of *K* indicates a higher correlation between the two top *k* lists. It should be noted that 0 ≤ *K* ≤ 1. In particular, when there is no overlap between the two top *k* lists, we obtain *K* = 0.

For the dynamic win-lose scores at , i.e., at the end of the entire period, we calculate *K* with *k* = 300 for different pairs of *α* and *β* values. The results for *β* = 1/365 and different values of *α* are shown in Fig. 3. The top *k* lists are similar (i.e., *K* ≥ 0.85) for any *α* larger than ≈ 0.06. This finding is consistent with the fact that the prediction accuracy is high and robust when *α* falls between ≈ 0.08 and ≈ 0.2 (Fig. 2(a)).

For fixed values of *α*, the *K* values between the ranking with *β* = 1/365 and that with various values of *β* are shown in Fig. 4. *K* is almost unity at least in the range 0 ≤ *β* ≤ 2/365. Therefore, removing the assumption of the exponential decay of score in time (i.e., *β* = 0) little changes the top 300 list. This finding is consistent with the result that the prediction accuracy is almost the same between *β* = 0 and *β* = 1/365 if 0.1 ≤ *α* ≤ 0.2 (see the previous subsection). Nevertheless, this observation does not imply that we can ignore the temporal aspect of the data. Keeping the order of the games contributes to the performance of prediction, as suggested by the comparison between the prediction results for the dynamic (Fig. 2(a)) and original (Fig. 2(b)) win-lose scores.

### Dynamics of scores for individual players

In contrast to the original win-lose score and prestige score, the dynamic win-lose score can track dynamics of the strength of each player. It should be noted that the summation of the scores over the individuals, i.e., , depends on time. In particular, it grows almost exponentially for the parameter values with which the prediction accuracy is high (i.e., *α* larger than ≈ 0.08), as shown in Fig. 5. increases with the number of games, or equivalently, with time because more recent players take more advantage of indirect wins than older players. The increase in is not owing to the number of players or games observed per year; in fact, the latter numbers do not increase in time^{6}.

Therefore, for clarity, we normalize the win-lose score of each player by dividing it by the instantaneous value. The time courses of the normalized win-lose scores for four renowned players are shown in Fig. 6(a). We set *α* = 0.13 and *β* = 1/365, for which the prediction is approximately the most accurate. The ATP rankings of the four players during the same period are shown in Fig. 6(b) for comparison. The time courses of the dynamic win-lose score and those of the ATP rankings are similar. In particular, the times at which the strength of one player (e.g., Federer) begins to exceed another player (e.g., Agassi) are similar between Figs. 6(a) and 6(b). Figure 6 suggests that the dynamic win-lose score appositely captures rises and falls of these players.

## Discussion

We extended the win-lose score for static sports networks^{9} to the case of dynamic networks. By assuming that the score decays exponentially in time, we could derive closed online update equations for the win and lose scores. The proposed dynamic win-lose score realizes a higher prediction accuracy than the original win-lose score and the prestige score. It is straightforward to extend the dynamic win-lose score to incorporate factors such as the importance of each tournament or game via modifications of the game matrix . We also confirmed the robustness of the ranking against variation in the two parameter values in the model. Finally, the dynamic win-lose score is capable of tracking dynamics of players' strengths.

It seems that network-based ranking systems are easier to understand and implement, and more scalable than those based on statistical methods. The dynamic win-lose score share these desirable features with static network-based ranking systems.

The applicability of the idea behind the dynamic win-lose score is not limited to the case of the win-lose score. In fact, we implemented a dynamic variant of the prestige score. It even yielded a larger prediction accuracy than the dynamic win-lose score did. This result implies that the idea of network-based dynamic ranking systems may be a powerful approach to assessing strengths of sports players and teams, which fluctuate over time. The dynamic win-lose score is better than our version of the dynamic prestige score in that only the former allows for a set of closed online update equations. Establishing similar update equations for other network-based ranking systems such as the prestige score and the Laplacian centrality (see Introduction) is warranted for future work. Prospective results obtained through this line of researches may be also useful in systematically deriving dynamic centrality measures for temporal networks in general.

## Methods

### Park & Newman's win-lose score

The win-lose score by Park and Newman^{9} is a network-based static ranking system defined as follows. We assume *N* players and denote by *A _{ij}* (1 ≤

*i*,

*j*≤

*N*) the number of times that player

*j*wins against player

*i*during the entire period. We let

*α*(0 ≤

*α*< 1) be a constant representing the weight of indirect wins. For example, if player

*i*wins against

*j*and

*j*wins against

*k*,

*i*gains score 1 from the direct win against

*j*and score

*α*from the indirect win against

*k*. Therefore, the

*i*'s win score is equal to 1 +

*α*. If

*k*wins against yet another player , the

*i*'s win score is altered to 1 +

*α*+

*α*

^{2}.

The win scores of the players are given bywhere *W* is the *N* × *N* matrix whose (*i*, *j*) element represents the score that player *j* obtains via direct and indirect wins against player *i*, ** w** is the

*N*dimensional column vector whose

*i*th element represents the win score of player

*i*, and

**1**is the

*N*dimensional column vector defined byWe similarly obtain the lose scores of the

*N*players in vector form by replacing

*A*with

*A*

^{⊤}as follows: The total win-lose score is given in vector form by

### Prestige score

The prestige score of player *i*, denoted by *P _{i}*, is defined bywhere

*q*is a constant, is the number of times player

*i*defeats player

*j*during the entire period (it should be noted that has nothing to do with the win scores denoted by

**in Eqs. (2) and (12)), is equal to the number of losses for player**

*w**j*, if , and if The normalization is given by . We set

*q*= 0.15, as in ref. [6], and also

*q*= 0.05 and

*q*= 0.30.

To define a dynamic variant of the prestige score, we let used in Eq. (16) depend on time. We define at time *t* bywhere is the (*j*, *i*) element of the win-lose matrix , and the summation over *n* is taken over the games that occur before time *t*. Substituting Eq. (17) in Eq. (16) yields the dynamic prestige score *P _{i}* (1 ≤

*i*≤

*N*) at time

*t*. We set

*β*= 1/365, which is the same value as that used for the dynamic win-lose score.

### Data

We collected the data from the website of ATP^{23}. Except when we compared the prediction accuracy for the dynamic win-lose score with that for the ATP rankings, we used single games in ATP World Tour tournaments recorded on this website. The data set contains 137842 singles games from December 1972 to May 2010 and involves 5039 players that participated in at least one game. Because the source of our data set is the same as that of Radicchi's data set^{6} and the period of the data is similar, the number of games contained in our data and that in Radicchi's are close to each other.

In the comparison between the dynamic win-lose score and the ATP rankings, we used all the types of single games recorded on the website of ATP. They include the games belonging to ATP Challenger Tours and ITF Futures tournaments in addition to ATP World Tour tournament games. We used this data set because it corresponds to the games on which the calculation of the ATP rankings is based. The ATP rankings are not available on a regular basis in early years. Therefore, we used the data from July 23, 1984 to August 15, 2011. The data set contains 330796 games and involves 13077 players that participated in at least one game.

### Parameter values for the dynamic win-lose score

A guiding principle for setting the parameter values of a ranking system is to select the values that maximize the performance of prediction^{19,22}. Instead, we set *α* and *β* as follows.

In the original win-lose score, it is recommended that *α* is set to the value smaller than and close to the inverse of the largest eigenvalue of *A*^{9}. If *α* exceeds this upper limit, the original win-lose score diverges. For our data, the upper limit according to this criterion is equal to 1/206.80 = 0.0048355. However, the dynamic win-lose score converges irrespective of the values of *α* and *β* for the following reason. For expository purposes, let us assign different nodes to the same player at different times *t _{n}* (1 ≤

*n*≤

*n*

_{max}). Then, Eq. (1) implies that any link in the network, which represents a game at time

*t*, is directed from the winner at

_{n}*t*to the loser at

_{n}*t*or earlier times. Because there is no time-reversed link (i.e., from

_{n}*t*to

_{n}*t*, where

_{n′}*t*<

_{n}*t*) and any pair of players play at most once at any

_{n′}*t*, the network is acyclic. The upper limit of

_{n}*α*is infinite when the network is acyclic

^{9}. On the basis of this observation, we examine the behavior of the dynamic win-lose score for various values of

*α*.

In the official ATP ranking, the score of a player is calculated from the player's performance in the last 52 weeks ≈ one year^{23}. The results of the games in this time window contribute to the current ranking of the player with the same weight if the other conditions are equal. The dynamic win-lose score uses the results of all the games in the past, and the contribution of the game decays exponentially in time. By equating the contribution of a single game in the two ranking systems, we assume , which leads to *β* = 1/365. In Results, we also investigated the robustness of the ranking results against variations in the *α* and *β* values.

## References

- 1.
Stefani, R. T. Survey of the major world sports rating systems.

*J. Appl. Stat.***24**, 635–646 (1997). - 2.
Daniels, H. E. Round-robin tournament scores.

*Biometrika***56**, 295–299 (1969). - 3.
Moon, J. W. & Pullman, N. J. On generalized tournament matrices.

*SIAM Rev.***12**, 384–399 (1970). - 4.
Borm, N. E., Brink, R. V. D. & Slikker, M. An iterative procedure for evaluating digraph competitions.

*Ann. Operat. Res.***109**, 61–75 (2002). - 5.
Saavedra, S., Powers, S., McCotter, T., Porter, M. A. & Mucha, P. J. Mutually-antagonistic interactions in baseball networks.

*Physica A***389**, 1131–1141 (2010). - 6.
Radicchi, F. Who is the best player ever? A complex network analysis of the history of professional tennis.

*PLoS ONE***6**, e17249 (2011). - 7.
Callaghan, T., Mucha, P. J. & Porter, M. A. The bowl championship series: a mathematical review.

*Notices of the Am. Math. Soc.***51**, 887–893 (2004). - 8.
Herings, P. J. J., van der Laan, G. & Talman, D. The positional power of nodes in digraphs.

*Soc. Choice Welfare***24**, 439–454 (2005). - 9.
Park, J. & Newman, M. E. J. A. network-based ranking system for US college football.

*J. Stat. Mech.*P10014 (2005). - 10.
Holme, P. & Saramäki, J. Temporal networks.

*Phys. Rep.***519**, 97–125 (2012). - 11.
Tang, J., Musolesi, M., Mascolo, C., Latora, V. & Nicosia, V. Analysing information flows and key mediators through temporal centrality metrics. In:

*Proceedings of the 3rd Workshop on Social Network Systems*(2010). - 12.
Pan, R. K. & Saramäki, J. Path lengths, correlations, and centrality in temporal networks.

*Phys. Rev. E***84**, 016105 (2011). - 13.
Grindrod, P., Parsons, M. C., Higham, D. J. & Estrada, E. Communicability across evolving networks.

*Phys. Rev. E***83**, 046120 (2011). - 14.
Elo, A. E.

*The Rating of Chess Players. Past & Present*(Arco, New York, 1978). - 15.
Bradley, R. A. Science, statistics, and paired comparisons.

*Biometrics***32**, 213–232 (1976). - 16.
Glickman, M. E. Paired comparison models with time-varying parameters.

*PhD Dissertation. Department of Statistics, Harvard University, Cambridge*(1993). - 17.
Fahrmeir, L. & Tutz, G. Dynamic stochastic models for time-dependent ordered paired comparison systems.

*J. Amer. Stat. Asso.***89**, 1438–1449 (1994). - 18.
Glickman, M. E. Parameter estimation in large dynamic paired comparison experiments.

*J. R. Stat. Soc. Ser. C***48**, 377–394 (1999). - 19.
Knorr-Held, L. Dynamic rating of sports teams.

*J. R. Stat. Soc. Ser. D***49**, 261–276 (2000). - 20.
Coulom, R. Whole-history rating: a Bayesian rating system for players of time-varying strength.

*LNCS***5131**, 113–124 (2008). - 21.
Herbrich, R., Minka, T. & Graepel, T. TrueSkill™: a Bayesian skill rating system.

*Advances in Neural Information Processing Systems***19**, 569–576 (2007). - 22.
Dixon, M. J. & Coles, S. G. Modelling association football scores and inefficiencies in the football betting market.

*J. R. Stat. Soc. Ser. C***46**, 265–280 (1997). - 23.
http://www.atpworldtour.com (date of access: October 1, 2011).

- 24.
Martinich, J. College football rankings: do the computers know best?

*Interfaces***32**, 85–94 (2002). - 25.
Ben-Naim, E., Vazquez, F. & Redner, S. Parity and predictability of competitions.

*J. Quantitative Analysis in Sports***2**(**4)**, article 1 (2006). - 26.
Lundh, T. Which ball is the roundest? — a suggested tournament stability index.

*J. Quantitative Analysis in Sports***2**(**3)**, article 1 (2006). - 27.
Park, J. Diagrammatic perturbation methods in networks and sports ranking combinatorics.

*J. Stat. Mech.*P04006 (2010). - 28.
Coleman, B. J. Minimizing game score violations in college football rankings.

*Interfaces***35**, 483–496 (2005). - 29.
Brin, S. & Page, L. Anatomy of a large-scale hypertextual web search engine.

*Proceedings of the Seventh International World Wide Web Conference*107–117 (1998). - 30.
Kendall, M. G. A new measure of rank correlation.

*Biometrika***30**, 81–93 (1938). - 31.
Fagin, R., Kumar, R. & Sivakumar, D. Comparing top

*k*lists.*SIAM J. Disc. Math.***17**, 134–160 (2003). - 32.
McCown, F. & Nelson, M. L. Agreeing to disagree: search engines and their public interfaces. In:

*Proceedings of the 7th ACM/IEEE-CS Joint Conference on Digital Libraries*309–318 (2007).

## Acknowledgements

We thank Mikio Ogawa for the assistance of data collection, Juyong Park for valuable discussion, Taro Takaguchi for critical reading of the manuscript, and the Association of Tennis Professionals for making the data set used in the present study publicly available. We acknowledge financial supports provided through Grants-in-Aid for Scientific Research (No. 23681033) and Innovative Areas “Systems Molecular Ethology” (No. 20115009) from MEXT, Japan. This research is also supported by the Aihara Project, the FIRST program from JSPS, initiated by CSTP.

## Author information

## Affiliations

### Department of Mathematical Informatics, The University of Tokyo, 7-3-1 Hongo, Bunkyo, Tokyo 113-8656, Japan

- Shun Motegi
- & Naoki Masuda

### PRESTO, Japan Science and Technology Agency, 4-1-8 Honcho, Kawaguchi, Saitama 332-0012, Japan

- Naoki Masuda

## Authors

### Search for Shun Motegi in:

### Search for Naoki Masuda in:

### Contributions

N.M. designed the research; S.M. contributed the computational results; S.M. and N.M. discussed the results; N.M. wrote the paper.

### Competing interests

The authors declare no competing financial interests.

## Corresponding author

Correspondence to Naoki Masuda.

## Rights and permissions

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-nd/3.0/

To obtain permission to re-use content from this article visit RightsLink.

## About this article

## Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.