Irrelevant matches in round-robin tournaments

We consider tournaments played by a set of players in order to establish a ranking among them. We introduce the notion of irrelevant match, as a match that does not influence the ultimate ranking of the involved parties. After discussing the basic properties of this notion, we seek out tournaments that have no irrelevant matches, focusing on the class of tournaments where each player challenges each other exactly once. We prove that tournaments with a static schedule and at least five players always include irrelevant matches. Conversely, dynamic schedules for an arbitrary number of players can be devised that avoid irrelevant matches, at least for one of the players involved in each match. Finally, we prove by computational means that there exist tournaments where all matches are relevant to both players, at least up to eight players.

Introduction
Tournaments consist of pairwise matches aimed at establishing a ranking among a set of participants. Sport competitions are often organized in tournaments that attract significant popular interest and financial resources. Depending on the type of tournament and on the ranking rule, there may be matches that are known to have no effect on the ultimate ranking of the two contestants, regardless of their outcome. Clearly, such irrelevant matches are undesirable, as they lack the incentive to win that is the very essence of any contest.
For instance, the last round of the preliminary stage of the UEFA Champions League 2014 (Group H) consisted in the matches Porto vs Shakhtar Donetsk and Athletic Bilbao vs BATE Borisov. The scoreboard before the round was: Porto was on top of the group with 13 points, Shakhtar Donetsk was second with 8 points, whereas Athletic Bilbao and BATE Borisov had 3 points each. Since in football tournaments winning a match yields 3 points, Shakhtar Donetsk had no chance of overtaking Porto and, conversely, neither Athletic Bilbao nor BATE Borisov could have overtaken Shakhtar Donetsk. Consequently, any possible outcome of the match Porto vs Shakhtar Donetsk would not have changed the final ranking of both the involved teams. Incidentally, the match ended in an unexciting 1-1 tie.
More recently, in Group F of the UEFA Champions League 2018, Manchester City was challenging Shakhtar Donetsk in the last round. The scoreboard before the match was: Manchester City on top with 15 points, Shakhtar Donetsk in second position with 9 points, Napoli 6 points, and finally Feyenoord with 0 points. With respect to the previous example, this case presents an asymmetric situation where Manchester City is not interested in the result of the match because it will be on top of the ranking in any case, whereas Shakhtar Donetsk is interested because, if it loses the match and Napoli wins against Feyenoord, its score would be reached by Napoli. Also this kind of matches is troublesome since it can unfairly skew the incentives.
In order to avoid the previous situations, the second stage of the UEFA Champions League is a knock-out tournament organized in rounds, where the team losing a match is immediately eliminated. Clearly, knock-out tournaments trivially ensure that each match is relevant for the involved teams, however they also have significant drawbacks. First, the number of teams has to be a power of 2. Secondly, they implicitly enforce a sort of transitivity condition such that whenever a beats b and b beats c, then a is evaluated as stronger than c, even if they never played against each other. However, in many sports the result of a match cannot be reduced to an absolute value measuring the strength of the two challengers, but it contextually depends on their abilities and tactics. Indeed, no treatment of roundrobin tournaments forces the transitivity of match outcomes [4,27,31].
In this paper, we formalize the notion of relevant and irrelevant matches and we tackle the problem of designing round-robin tournaments that contain no irrelevant matches. The very definition of relevance is not trivial. We start from the intuition that a match is relevant for one of the involved agents if the future ranking of that agent depends on its outcome. If the future ranking is uniquely determined by the outcome of the present match (say that we are analysing the last match in the tournament), then establishing the relevance of a match is relatively simple: we only need to compare two rankings from the point of view of the involved agents. However, in general, the future ranking is not uniquely determined by the outcome of the present match. Other matches may follow, possibly influencing the ultimate ranking. We resolve the uncertainty on the future matches via a probabilistic setting, in which players hold prior beliefs about the probability that any future match ends in either way, as in the classical Bradley-Terry model [3].
The paper is organized as follows. In Sect. 2, the basic concepts concerning matches, rankings, and tournaments are formalized. In particular, we assume for simplicity that a match between a and b can only end in two possible ways: a wins or b wins. Moreover, in common tournaments, the sequence of matches is fixed a-priori, regardless of the outcomes. We call these static tournaments. We also consider the more general class of dynamic tournaments, in which the sequence of matches adapts according to past outcomes.
Section 3 recalls the notion of score vector [27], and proves some related properties, used extensively in the following sections. Section 4 introduces the notion of relevant match for a given player, as a match where one outcome stochastically dominates the other [17,30], from the point of view of that player. Such probabilistic setting is based on the assumption that players hold beliefs about the likelihood of different outcomes for all future matches. In sport tournaments, these beliefs are not unlike the odds that the betting venues routinely publish as part of their business. We also prove two equivalent non-probabilistic characterizations of relevance, applicable to point-based round-robin tournaments [28]. For this class of tournaments, we show that relevance is essentially a local property of a match, that can be checked based on past matches only.
Relevance of a match ultimately depends on how the players compare different rankings according to a preference relation. Hence, in Sect. 5, we postulate a set of admissibility conditions over preferences, modelling the fact that players aim at outdoing the others.
Once the basic definitions have been laid out, in Sect. 6 we study the circumstances under which relevant (point-based round-robin) tournaments exist. Briefly, we obtain the following main results: 1. All tournaments with a static schedule and at least five players include a match that is irrelevant for both of the involved agents (Theorem 12). 2. For all numbers of players, there is a tournament with a dynamic schedule where all matches are relevant for at least one of the involved players (Theorem 13). Moreover, up to eight players, we algorithmically synthesize a dynamic tournament where matches are relevant for both the players. 3. All tournaments where all players are called to play with approximately equal frequency (called balanced tournaments) with at least six players include a match that is irrelevant for one of the involved players (Theorem 14).
In the conclusions, Fig. 6 provides an overview of the main results.

Related work
In graph theory, a tournament is a complete and asymmetric directed graph [27]. Nodes represent agents and an edge from a to b indicates that a won the match against b. In common terms, such a tournament is in fact an outcome of a round-robin (real-world) tournament. Hence, graph-theoretic tournaments ignore the temporal aspects and only focus on the ultimate outcome of all the matches. On the other hand, a match may be relevant if played at the beginning of a tournament and irrelevant if played towards the end. So, in this paper we explicitly model the temporal ordering of the matches.
Designing tournament schedules that optimize certain measures of interest is a topic that has been attracting an increasing amount of literature [2,9,19,29]. Typical objectives include balancing home and away matches, harmonizing referee assignments to teams and venues, minimizing the distance travelled by the teams, and balancing the sequence of adversaries to limit the so-called carry-over effect. 1 Goossens and Spieksma provide an overview of European soccer schedules, observing in particular that the canonical schedule adopted in 2008 by several national championships presents a high incidence of the carryover effect [15].
Scarf et al. explicitly mention match relevance as a success factor in tournament design [32]. Using random sampling, they compare a collection of standard tournament designs on the basis of different metrics, including the rate of irrelevant matches. In this paper, our aim is not to measure the prevalence of irrelevant matches w.r.t. some fixed tournament design, but rather to investigate the existence of tournament designs where irrelevant matches do not occur.
A measure of relevance has been investigated in [31,33] for static round-robin tournaments. Roughly speaking, in those papers the relevance of a match is the increase in 5 Page 4 of 34 probability of achieving a parametric goal (e.g., coming in first) when winning that match (w.r.t. losing it). On the other hand, our notion of relevance is not parameterized by a goal, instead we postulate a preference framework shared by all players where any swap in the final ranking matters. In addition, as mentioned above, we also consider dynamic tournaments.
In a recent paper [8], the authors propose a new dynamic tournament scheme, called a reaper tournament, with the objective of satisfying ranking precision and competitiveness development, the latter being a semi-formal analogue of our notion of relevance. Regarding round-robin tournaments, the authors merely point out examples where competitiveness development is violated.
Gotzes and Hoppmann [16] use integer programming to address the following problem: at any point of a tournament, what are the lowest and highest final ranks a certain team can ultimately achieve? The authors focus on the Bundesliga, Germany's primary football division, but their approach is directly applicable to other national football league systems. The final rank problem has some connection with our notion of relevance (roughly, a match is irrelevant for a team if its lowest and highest attainable final ranks are equal). Other than that, the two problems show substantial differences. First, their problem depends only on which matches are left, but not on their order. Secondly, determining the lowest/highest final rank requires to search the possible outcomes of the remaining matches. We show, instead, that deciding whether a match is relevant for a team does not require to consider future courses but it can be easily computed on the basis of the current situation only.
The problem of ranking the participants to a tournament has been studied in the literature, with the two most prominent approaches being the maximum likelihood method and the points system [22,28]. In this paper, we focus on the points system, as it is commonly used in real-world tournaments.
Tournament rankings are special cases of rank aggregation problems, widely studied in machine learning [7,35]. The common objectives in that area are orthogonal to ours, mainly concerning accuracy (i.e., obtaining a ranking that is close to some model of ground truth) and efficiency (i.e., obtaining a ranking from few comparisons).
In computational social choice, tournaments can be used to represent pairwise comparisons among different alternatives. In this perspective, each player represents a possible alternative and a match corresponds to a preference judgment (e.g., a majority voting) between two alternatives. Eventually, a tournament is identified with a complete and asymmetric directed graph [27]. If an alternative beats all the others, it is unquestionably the best choice. In the other cases, it is not straightforward how to filter a set of "winners" as result of a tournament. In the literature, several solutions have been proposed and evaluated w.r.t. different admissibility criteria (monotonicity, stability, strategyproofness, etc.) [4]. Laffond et al., for example, propose a solution correspondence, called the bipartisan set, based on Nash equilibrium [14]. More specifically, they considered a two-players zero-sum game over a tournament where each player chooses an alternative, a player wins the game if its alternative beats in the tournament the one chosen by the opponent. They proved that such a game has a unique equilibrium in mixed strategies. Then, all the alternatives that are not in support of the equilibrium are strategically rejected whereas the remaining ones constitute the bipartisan set. Moulin proposed a single-valued selection correspondence based on multi-stage elimination trees [23]. On the positive side, the selected winner is Pareto-optimal and refines other well known solution concepts such as the top cycle and the uncovered set. 2 On the negative side, this methodology does not satisfy neutrality, i.e., it is not invariant under permutation of the alternatives.
Finally, the Economics literature discusses tournament design with the objective of maximizing profit for the organizers [10,34]. The inquiry that is most related to ours finds strong correlation between match attendance and importance for either team, where the latter is measured by an ad-hoc formula based on the possibility that the team will win the championship and the number of remaining matches [18]. Another recent work focuses on multi-tournament scenarios in which it is convenient for a team to lose rather than win a match [6].
Relation to our previous works. The present work is based on [12] and extends it in several ways. First, the notion of relevance and its properties were based on a single preference relation over rankings, namely the lexicographic preference. Here, we consider an entire class of admissible preferences (Sect. 5) which includes all preferences based on linear utility (the lexicographic preference is a particular case thereof).
Secondly, we present a novel result reducing the relevance of a match in a tournament to a local property, based on the number of remaining matches of the involved players and the score differences with the other players (Theorem 5). Using this local characterization, one can recognize an irrelevant match without enumerating all possible futures, which are exponentially many in the number of remaining matches. The local characterization also induces some conditions which, roughly speaking, predict the presence of an irrelevant match at an earlier stage of the tournament. We use these conditions as an optimization technique in a search algorithm which decides whether there exists a strongly relevant tournament for a given number of players. This search algorithm allows us to present here the first positive results on strongly relevant tournaments, described in Sect. 6.4.
Finally, Sect. 4.3 provides a novel lower bound to the stage at which an irrelevant match may occur.

Preliminaries
Informally, by tournament we mean a plan of matches among multiple players which eventually produces a scoreboard, according to the outcomes of the single matches. More specifically, in this paper we focus on tournaments that are ordinal in the sense that what really matters is the mutual placement of players rather than their absolute scores. Moreover, as in [1,24,30], a scoreboard can in principle fail to distinguish two agents. For these reasons, we assume that the final outcome of a tournament is a weak order, representing a ranking among players, including ties.
In the following, unless differently specified, we assume a fixed set of players A = {1, … , n} . A ranking is a weak order on A , i.e., a total, reflexive, and transitive relation, ⪯ ⊆ A × A . As usual, by ∼ and ≺ we denote the symmetric and asymmetric parts of ⪯ , respectively. Intuitively, a ≺ b means that player b has a better placement than a, whereas a ∼ b means that they are ranked the same (a.k.a. a tie).
We call match an unordered pair {a, b} of distinct players. Generally speaking, a match may have multiple outcomes. In this work, we focus on binary tournaments, whose matches can have one of two possible outcomes: a wins (and b loses) or vice versa. We represent the outcome of a match via an ordered pair of players, where the first component indicates who won the match; for instance (a, b) means that a prevailed in a match against b. We call such pairs events.
Then, a tournament T is a labelled full binary tree where: (i) each internal node x is labelled with a match {a, b} ; (ii) its two outgoing arcs are labelled with a and b, respectively; (iii) each leaf is labelled with a ranking. Intuitively, given an internal node x labelled with a match {a, b} , the outgoing a-arc corresponds to a having won the match (and therefore, b having lost it). Analogously, the outgoing b-arc corresponds to b having won the match. Thereafter, internal nodes will also be called match nodes.
A path = (x 1 , … , x m ) in a tournament is a sequence of nodes such that x i+1 is a child of x i . If the final node of is a leaf, then is called a terminal path and the ranking labeling the leaf is denoted by ⪯ . A full path is a terminal path whose first node is the root of T .
Given a path = (x 1 , … , x m ) , we denote by ⟨ ⟩ = (e 1 , … , e m−1 ) the sequence of associated events where, for each 1 ≤ i ≤ m − 1 , e i is the pair (a, b) such that {a, b} is the match associated to x i and the arc ( In what follows let (a, ) be the number of matches won by a in , that is the number of events (a, ⋅) in ⟨ ⟩ . Similarly, (a, ) is the number of matches lost by a in . Finally, if ⟨ ⟩ is a permutation of ⟨ ′ ⟩ , then we say that the paths and ′ are homologous.

Remark
In some popular tournaments, as national football leagues, a match can possibly end with a tie. Here, we do not consider ties to make our model as simple as possible. However, this assumption encompasses many real-world situations. For example, all sports where a match ends when one of the contenders gets a predetermined number of points (e.g., tennis, table tennis, volley, fencing) do not admit ties. 3 In other sports like basket if the score is tied after regular time, then an overtime period is held to break the tie.

Types of tournaments.
We distinguish the following families of tournaments: -A tournament is static if it is a complete tree and all its internal nodes at a given level are labeled with the same match. In other words, the sequence of matches is the same on all full paths. -A round-robin tournament is a tournament where in all full paths each player challenges each other exactly once. Notice that each full path in a round-robin tournament with n players comprises n 2 = n(n−1) 2 match nodes.
Furthermore, a round-robin tournament is balanced if n is even and for all full paths and all 0 ≤ i ≤ n − 2 , the set of n 2 match nodes involves all players. In other words, balanced tournaments are organized into n − 1 rounds. Every player plays one match in each round. where c is a player, is a full path, and p , p are real numbers. We say that a tournament is point-based if there exist p < p such that for all full paths and players a and b, Figure 1 shows two tournaments T 1 and T 2 among the players a, b, and c.

Example 1
In T 1 all full paths share the same sequence of matches and each player challenges the other ones exactly once. Therefore, T 1 is a static round-robin tournament. Moreover, the placement of a player at the end of a full path depends on the number of matches it won, i.e., t 1 ⪯ t 2 iff (t 1 , ) ≤ (t 2 , ) . Then, since (⋅, ) corresponds to the score function where p = 0 and p = 1 , we have that T 1 is point-based.
The second tournament T 2 is also round-robin and point-based. However, if player a wins the first match than the order of the reamaning matches is the same as in T 1 , otherwise the order is the opposite. This means that the schedule of matches dynamically changes depending on the outcomes of the previous matches. So, T 2 is a dynamic round-robin point-based tournament. Similarly to utility functions in Decision Theory [25], the following theorem shows that the score function associated to a point-based tournament is invariant under linear transformations.

Theorem 1 Let T be a point-based round-robin tournament and let p and p be
two real values such that p < p . Then, for each full path , we have that Proof From T being point-based, there exist some p ′ < p ′ such that, for each full path , the score function (⋅, , p � , p � ) is monotonic w.r.t. the ranking ⪯ . Moreover, from T being round-robin, it holds that (a, ) = (n − 1) − (a, ) . Then, we have that Since > 0 , then (⋅, , p , p ) and (⋅, , p � , p � ) are co-monotonic and hence the thesis. ◻ Roughly speaking, Theorem 1 says that the score function representing a pointbased round-robin tournament does not depend on which weights p < p we choose. Therefore, w.l.o.g. we will always assume that p = 0 and p = 1 , that is, (a, ) = (a, ).

Score vectors
The score vector v of a full path is the sequence of scores { (a, )} a∈A , ordered by increasing value [27]. We say that a vector u of integers is a round-robin score vector if there exist a round-robin tournament T and a full path in T such that u is the score vector of . We recall the following classical result, known as Landau's theorem. Theorem 2 ([20]) A vector (u 1 , … , u n ) ∈ ℕ n is a round-robin score vector if and only if, Consider a node x in a round-robin tournament T and its children x ′ and x ′′ . It is straightforward to see that the homology relation induces a bijection between the terminal paths starting from x ′ and those starting from x ′′ . In particular, if T is also static, then two homologous paths 1 and 2 induce the same sequence of events, i.e., Example 2 Consider again the tournament T 1 in Fig. 1 and the paths 1 and 2 highlighted in bold. Since both ⟨ 1 ⟩ and ⟨ 2 ⟩ are equal to ((c, a), (b, c)), these paths are clearly homologous. In T 2 , the analogous paths 3 and 4 highlighted in bold do not satisfy the property hence also 3 and 4 are homologous.
The following two lemmas will be used in Sect. 6. 4 The first one states that, once we fix the number of players, all possible round-robin score vectors satisfying Theorem 2 occur in all point-based round-robin tournaments.

Lemma 1 Let T be a point-based round-robin tournament with n players and let u be
a round-robin score vector with n players. Then, there exists a full path in T such that u = v .
In the following, given a score vector (s 1 , … , s n ) , we say that the vector ( 0 , … , n−1 ) is the corresponding score difference vector, where 0 = s 1 and i = s i+1 − s i for all i = 1, … , n − 1 . We refer to a zero-valued score difference i as a plateau. The second lemma states that, whenever a score difference i is higher than 1, there are at least i plateaus. In other words, the number of plateaus is at least as large as the greatest score difference, provided the latter is greater than 1.

Notions of relevance
We would like each match in a tournament to be relevant to both players involved. Intuitively, a match is relevant for a player if its future ranking depends in a significant way on the outcome of that match. To define exactly what changes in ranking are significant for a given player, we need to make assumptions on the way in which players compare rankings. Clearly, players prefer to be as high as possible in the ranking. But do they care about which players are above and below them? And are they interested in how many other players share their own position in the ranking? 5 We restrict the space of all possible preferences among rankings to a family of so-called admissible preferences. Such a family is general enough to encompass most practical scenarios, while providing the basic properties needed by our results. The breadth and the limits of the family of admissible preferences are further discussed in Sect. 5.
First, for a given player a we define two flavors of dominance on rankings: weak dominance and dominance. For all pairs of rankings ⪯ 1 and ⪯ 2 , it holds WDom a (⪯ 1 , iff WDom a (⪯ 1 , ⪯ 2 ) and there exists a player b such that either (i) a ≺ 1 b and b ⪯ 2 a , or (ii) a ∼ 1 b and b ≺ 2 a . Roughly speaking, weak dominance indicates that one ranking is at least as good as another, from the point of view of the given player a. If additionally the placement of a w.r.t. another player b is strictly better, we are in the presence of (strong) dominance.
Notice that WDom a and Dom a are a preorder and a strict partial order, respectively, whereas preferences are required to be weak orders. Then, an admissible a-preference P a over rankings is a weak order refining WDom a and whose asymmetric part refines Dom a . Formally, Thereafter, we assume that any player a has a fixed admissible preference relation P a . We write [⪯] a to denote the class of rankings ⪯ � that are a-equivalent to ⪯ , i.e., P a (⪯, ⪯ � ) and P a (⪯ � , ⪯) . Since the number of possible rankings is finite, P a induces a finite number C a 1 , … , C a m of a-equivalent classes, linearly ordered by P a . We can now proceed to define when a match in a tournament is relevant to a given player. As anticipated in the introduction, we adopt a probabilistic view: we assume that each player is equipped with a belief about the likelihood of different outcomes for all future matches. We assume that players are never absolutely certain about the outcome of future matches, so that the likelihood of a given outcome lies in the open interval (0, 1).
In the following, we fix a tournament T and omit it from the notation. A belief is a function ∶ A × A → (0, 1) assigning probabilities to the outcomes of every possible match. Since matches are zero-sum games where one player wins and one player loses, it also holds that (a, b) + (b, a) = 1 , for all players a, b ∈ A.
The probability of any path = (x 1 , … , x m ) is obtained by combining the beliefs of the corresponding events, treated as stochastically independent: where ⟨ ⟩ = (e 1 , … , e m−1 ) . Note that homologous paths have the same probability to occur according to any belief.
For a player a, let R a be the random variable assigning to each terminal path the a-equivalence class of the ranking ⪯ , i.e., R a ( ) = [⪯ ] a . We denote by (R a , x, ) the distribution of R a over all terminal paths starting from x . More precisely, given an internal node x and an a-equivalence class C a j , with 1 ≤ j ≤ m , let (x, a, j) be set of all terminal paths starting from x whose final ranking belongs to C a j . Then, (R a , x, ) associates to the class C a j the probability Example 3 Consider again the tournament T 1 in Fig. 1 and assume that a bookmaker estimates the following odds : player a has a probability 0.7 of beating b and a probability 0.5 of beating player c; player b has a probability 0.4 of beating c. (1) According to the final rankings, each player t ∈ {a, b, c} has four different equivalence is the set of all rankings where t comes in last, C t 2 means that t is in the second position, C t 3 is the case where all the players tie, and finally in C t 4 t takes the first position with no ties.
Thus, the class C a 4 corresponds in Fig. 1 to the two leftmost paths. Let x be the root of the tree, (R a , x, ) assigns probability 0.7 * 0.5 = 0.35 to C a 4 . Similarly, the paths where player b takes the second position are the leftmost and the rightmost ones, hence C b 2 has probability 0.14 + 0.09 = 0.23. Now, we formalize when player a prefers an internal node x 1 to another node x 2 , based on the corresponding distributions 1 = (R a , x 1 , ) and 2 = (R a , x 2 , ) . This notion is based on stochastic dominance between two distributions taking values over a linearly ordered set [17]. In our case, the linear order is the set C a 1 , … , C a m of a-equivalence classes ordered by P a . Let 1 and 2 be the cumulative probabilities of 1 and 2 , respectively: , with a strict inequality for at least one value of k. Stochastic dominance is a well-known and robust notion to lift qualitative preference relations over distributions. In particular, it holds that 2 stochastically dominates 1 iff for all utility functions over rankings conforming with P a , the expected utility of 2 is greater than the one of 1 .

Definition 1
is strongly (resp., weakly) relevant iff all internal nodes are relevant for both (resp., at least one of the) involved players.  Given a generic belief , since at this point player b will surely take first place with no ties, the admissibility of P b (precisely, condition 1 of admissibility) ensures that both distributions (R b , x b , ) and (R b , x c , ) assign probability 1 to the same P b -equivalence class, and zero to all the other classes. Consequently, none of the distributions stochastically dominates the other and x is b-irrelevant.
Remark Notice that weakly relevant matches are not more desirable than irrelevant matches, the adjective "weakly" has a pure mathematical flavor. Consider for example the match of UEFA Champions League 2018 described in the introduction (Machester City vs Shakhtar Donetsk). Machester City, which was ranked first in any case, had a notably turnover of its first-string players to make them repose. Then, against the odds, Shakhtar Donetsk won the match and Napoli was inexorably ruled out. The fact that only one contender is interested in winning can affect the result of a weakly relevant match and unfairly distort the final ranking.

Getting rid of probabilities
For round-robin tournaments, we now develop a characterization of relevance that avoids any reference to the probabilistic setting. We say that an internal node x labelled with {a, b} is c-important, with c ∈ {a, b} , if there exists a terminal path from x a whose ranking is not c-equivalent to the ranking of the homologous path starting from x b . The following theorem states that, in round-robin tournaments, relevance implies importance.

Theorem 3 For all nodes x in a round-robin tournament and all players c, if x is c-relevant, then it is c-important.
Proof Assume that node x labelled with a match {a, b} is c-relevant. Recall that for all beliefs and all pairs of homologous paths 1 and 2 , assigns the same probability to them, i.e., Pr Assume by contradiction that x is not c-important. As usual, denote by x a and x b the children of x . By definition, it follows that all pairs of homologous paths starting from x a and x b , respectively, end with c-equivalent rankings. Hence, the two distributions (R c , x a , ) and (R c , x b , ) are equal, and so neither one stochastically dominates the other, contradicting our initial assumption that x is c-relevant. ◻ Next, we prove that if the tournament is additionally point-based, relevance is equivalent to importance.

Theorem 4 For all point-based round-robin tournaments, a node labelled with match
Proof Theorem 3 implies the "only if" direction, so we are left to prove the "if" implication.
Assume that x is c-important, it follows that there exist two homologous terminal paths a and b starting from x a and x b , respectively, such that ⪯ a and ⪯ b are not c-equivalent. Assume w.l.o.g. that c = a . As the tournament is point-based, the score of a at the end of a is equal to the score at the end of b plus one. The scores of all other players in a are less or equal than in b . Consequently, ⪯ a weakly dominates ⪯ b from the point of view of player a and hence be the a-equivalence classes of rankings, ordered by P a . Let be any belief and let a (resp., b ) be the cumulative distribution of (R a , x a , ) (resp., (R a , x b , ) ). For all homologous paths ′ a and ′ b starting from x a and x b , respectively, it holds by the same argument as before that . This means that if ⪯ � a belongs to the class C a i , then ⪯ � b belongs to a class C a j with j ≥ i . As a consequence, we have that a (C a i ) ≤ b (C a i ) for all i = 1, … , m. In order to prove stochastic dominance, it remains to show that there exists an 1 ≤ i ≤ m such that the above inequality is strict. Let C a k be the least preferred class in that linear order such that there exist two homologous paths ′′ a and ′′ b starting from x a and x b , respectively, with ′′ b ending in C a k and ′′ a ending in a different, and hence strictly preferred, class. Such a class is guaranteed to exist, due to the pair of paths a and b . Let It follows that , and our thesis. ◻ Fig. 2. Let x be the root and ⪯ 1 , … , ⪯ 4 be the final rankings from left to right. Consider the two rankings ⪯ 1 and ⪯ 3 . Since in the former c takes third place whereas in the latter c comes in second, by admissibility we have that c strictly prefers ⪯ 3 over ⪯ 1 , i.e., P c (⪯ 1 , ⪯ 3 ) and not P c (⪯ 3 , ⪯ 1 ) . Now, those rankings appear at the end of the two homologous paths ⟨x b , ⪯ 1 ⟩ and ⟨x c , ⪯ 3 ⟩ . Consequently, by definition x is c-important and, by Theorem 4, also c-relevant.

Example 5 Consider again
Being point-based is necessary for Theorem 4 to hold. In particular, consider Fig. 3, which depicts a fragment of a 3-player round-robin tournament. Notice that the tournament is not point-based. To see this, call ⪯ 1 , … , ⪯ 4 the four final rankings, left to right. In the path leading to ⪯ 3 , a (resp., c) has won one more match (resp., one fewer match) compared to the path leading to ⪯ 4 . This contradicts the fact that a ≺ 3 c and c ≺ 4 a . In fact, the ranking ≺ 4 is intentionally unrealistic, in order to violate the equivalence in Theorem 4. Now, let x be the root of the fragment, and x b and x c be its left and right children, respectively. Observe that x is c-important but not c-relevant. Importance follows from comparing the two homologous paths starting from x b and x c and leading to ⪯ 1 and ⪯ 3 , respectively. Then, consider the belief that assigns equal probabilities to either player winning the match {a, c} . According to , in both x b and x c player c has probability 1 2 of being second and probability 1 2 of being third (i.e., (R c , x b , ) = (R c , x c , ) ). So, neither distribution stochastically dominates the other and therefore x is not c-relevant.

Getting rid of the future
Theorem 4 provides an effective procedure to check in round-robin point-based tournaments whether a match x is irrelevant for one of the involved players. However, since the number of homologous terminal paths descending from the children of x is exponential in the number of remaining matches, the notion of importance is not computationally tractable and hence it cannot be used in practice as such. Fortunately, we show that there exist more efficient ways to check the importance of a node that do not require to look at its possible futures. It simply suffices to compare some quantities that can be derived locally.
Furthermore, we also show that in some cases it is possible to foresee the presence of an irrelevant node at an earlier stage of the tournament. This will be used in Sect. 6.4 to speed up a procedure that checks whether a strongly relevant dynamic tournament exists for a given number of participants.
Given a node x of a round-robin point-based tournament T , let r i be the number of matches that player i has not played yet, including the match associated to x in case i is one of the involved players, and let s i be its current score -that is s i = ( , i) , where is the path from the root to x . Then, let Abv i (resp. Blw i ) be the set of players j ≠ i such that s j ≥ s i (resp. s j ≤ s i ). Note that, if Abv i ∩ Blw i ≠ � , then i ties with another player. Instead, Abv i = � (resp. Blw i = � ) means that player i ranks first (resp. last), with no ties. Now, let h and k be two players such that, in x , s h ≤ s k . We denote by d hk = r h + s h − s k the score difference between h and k assuming that h wins all its remaining matches and, conversely, k loses all remaining matches. Finally, for each player h, let h and h be defined as follows: Notice that, in case Abv h ≠ ∅ , h is the maximum d hk for k ∈ Abv h , so it intuitively represents how many chances player h has of catching up with an opponent having a better score (if h does not tie with any other player) or overcoming a player with the same score.
In case h has the highest score with no ties, i.e. Abv h = � , we assign the conventional value −1 which, roughly speaking, represents the fact that currently h cannot improve its ranking (since it is already first with no ties).
Similarly, h represents the number of chances to be reached or overcome by a player with a lower or equal score. As before, we use −1 in case h ranks last with no ties, i.e. Blw h = �.
The following theorem establishes that a node is important for one of the involved players c if and only if c has some chance to reach a player with a better score or a player with a lower score than c can reach c. Let h be the maximum between h and h . For the "if" direction, a ≥ 0 means that either a ≥ 0 or a ≥ 0 . We will show that x is a-important in both cases. Assume first that a ≥ 0 . By definition, there exists a player k with s k ≥ s a such that r a ≥ s k − s a . We distinguish two cases, s k = s a and s k > s a .
Let s k = s a and consider two homologous paths and ′ starting from x a and x b , respectively, where a loses all its matches and k wins only against a (in case the match {a, k} occurs in the paths). Notice that the final score of a is s k + 1 in , and s k in ′ , whereas the score of b can be: s k in both and ′ ; s k + 1 in both and ′ ; or s k in and s k + 1 in ′ (in case k = b ). Therefore, since and ′ are homologous, we have that: (i) for all other players h, if a ⪯ h , then a ⪯ � h , and (ii) either a ≺ ′ k and a ∼ k , or a ∼ � k and a ≻ k . Then, in all cases Dom a (⪯ � , ⪯ ) holds and hence x is a-important.
Then, assume s k > s a . This time we let k lose all its matches in and ′ , and we let a win s k − s a matches, if r a > s k − s a , and all the remaining s k − s a − 1 matches otherwise (if r a = s k − s a ). Then, the final scores of a and k can be the pairs (i) (s k , s k ) in and (s k − 1, s k ) in ′ , (ii) (s k + 1, s k ) in and (s k , s k ) in ′ , or (iii) (s k , s k ) in and (s k , s k + 1) in ′ (this last situation occurs in case k = b ). Consequently, Dom a (⪯ � , ⪯ ) holds in all cases and hence x is a-important.
Next, assume that a ≥ 0 , which means that s k ≤ s a and r k ≥ s a − s k , for some player k. As before, consider two homologous paths and ′ from x a and x b , respectively. Now, if s k = s a , we let a lose all its remaining matches and k win only against a, if that match is yet to be played. Conversely, if s k < s a , then a loses every time and k wins s a − s k matches, if k ≠ b , or s a − s k − 1 matches otherwise. Similarly to the previous case, in both cases Dom a (⪯ � , ⪯ ) holds.
For the "only if" direction, we will show the contrapositive. Assume that a < 0 ; this means that both a and a are negative. Let and ′ be two homologous paths starting from x a and x b , respectively. In , the final score of a ranges from s a + 1 to s a + r a . In ′ the only difference is that a has one point less, because it lost the match in x , so its final score ranges from s a to s a + r a − 1 . We consider three different cases.
First, let Abv a ≠ ∅ and Blw a ≠ ∅ . Since a < 0 and a < 0 , then each k ∈ Abv a has in both and ′ a final score greater than s a + r a and analogously the score of each k ∈ Blw a will be less than s a . This means that for all other players h: (i) neither a ∼ h nor a ∼ � h holds, and (ii) a ≺ h (resp. h ≺ a ) iff a ≺ ′ h (resp. h ≺ ′ a ). Then, it is straightforward to see that WDom a (⪯ , ⪯ � ) and WDom a (⪯ � , ⪯ ) . Therefore, ⪯ and ⪯ � are a-equivalent. Being and ′ two arbitrary homologous paths, x is not a-important.
Then, assume that Abv a ≠ ∅ and Blw a = � . Blw a = � means that in x a ranks last with no ties, so x is a-important only if winning gives to a the chance to reach some opponent. However, as before, the maximal score that a can attain is s a + r a and, since a < 0 , all the other players have a greater score. So, it is immediate to see that ⪯ and ⪯ � weakly dominate each other. Consequently, x is not a-important. Finally, assume Abv a = � and Blw a ≠ ∅ . Contrary to the previous case, a ranks first with no ties, and hence x is a-important only if winning could prevent some other player from reaching the score of a. However, a < 0 implies that no player can achieve that objective. So, for all other players h, it holds that h ≺ a and h ≺ ′ a . Therefore, as before ⪯ and ⪯ � weakly dominate each other and hence x is not a-important. ◻ So far, for the sake of simplicity, we have omitted the node x from the notation. In the next sections, when we need to compare different nodes, we will use a functional notation to make it explicit. For example, r a (x) and s a (x) denote the number of remaining matches and the current score of player a at node x , respectively.
Finally, we show some local properties that, if satisfied by a node x , ensure the presence of a non-strongly-relevant node in the sub-tree rooted in x . First we prove that, along a path, a cannot switch from a negative to a positive value.

Lemma 3 Let = (x 1 , … , x m ) be a path in a round-robin tournament. For each player
The next theorem shows three conditions predicting the presence of a non-strongly-relevant node in a sub-tree of a tournament, depending only on local properties of the root of the sub-tree. The first condition strengthens Theorem 5 on the basis of Lemma 3. The other two conditions are variants that, roughly speaking, directly check whether the last match of a player is relevant assuming that it wins (resp. it loses) all the other remaining matches.

Theorem 6 Let T be a round-robin point-based tournament, a be a player, and
x be a node in T . Moreover, assume that r a (x) > 0 and at least one of the following conditions holds: Then, T is not strongly relevant. Proof Assume that the first condition holds. Since r a (x) > 0 , player a has to challenge at least one other player, say b. Then, there exists a path from x to a node x ′ which is labelled with the match {a, b} . By Lemma 3, a (x � ) < 0 and hence, by Theorems 4 and 5 , T is not strongly relevant because x ′ is not a-relevant.
Assume that the second condition holds. Consider a path from x to a node x ′ where a has lost all the r a (x) − 1 remaining matches except the last one which is the label of x ′ . This means that r a (x � ) = 1 and s a (x) = s a (x � ) . From r a (x) − a (x) ≥ 2 we have that each player j in Abv a (x) has a score s j (x) which is at least s a (x) + 2 . Then, since s j (x) ≤ s j (x � ) , we have that r a (x � ) + s a (x � ) − s j (x � ) < 0 . Moreover, from a (x) < 0 we know that all the players in Blw a (x) , if any, have no chance to reach the score of a at x ′ . Consequently, Abv a (x) = Abv a (x � ) and Blw a (x) = Blw a (x � ) . Then, as before, we have that a (x � ) < 0 and a (x � ) < 0 and hence T is not strongly relevant because x ′ is not a-relevant.
Finally, assume that condition 3 above holds and consider a path from x to a node x ′ where, symmetrically to the previous case, a has won r a (x) − 1 matches except the last one which is the label of x ′ . Then, for all j ∈ A ⧵ {a} , we have that It follows that a (x � ) < 0 and a (x � ) is −1 . Similarly to the previous cases, we conclude that T is not strongly relevant. ◻ Thereafter, we say that x is doomed whenever it satisfies one of the three conditions in Theorem 6 for some player a. Note that if a node is not doomed, then by Theorem 5 that node is strongly relevant.

The earliest non-strongly-relevant match
Intuitively, the first matches of tournament are more likely to be relevant due to the large number of different possible futures. This rises the following natural question: when is the earliest possible round at which a non-strongly-relevant match can occur? The following theorem provides a lower bound to this question.

Theorem 7 Let T be a point-based round-robin tournament of n ≥ 5 players and
= (x 1 , … , x m ) be a path such that x m is not strongly relevant. Then, m > 2(n − 1).
Proof Let (s 1 , … , s n ) be the score vector at x m . For each player j, let r j the number of remaining matches and l j the number of lost matches. By definition, it holds that s j + r j + l j = n − 1 . Moreover, since m − 1 matches have been completed at node x m , we have that Since by assumption x m is not relevant, by Theorems 4 and 5 there exists a player i involved in the match of x m such that i < 0 . This implies that (i) r i > 0 , (ii) s i + r i < s k , for all k > i , and (iii) s i > s h + r h , for all h < i.

Moreover, assuming i > 1 , (5) implies that
Similarly, conditions (i) and (ii) imply that s k ≥ s i + 2 , for all k > i . Consequently, (4) implies: We now prove our thesis by showing that m − 1 > 2(n − 1) − 1 , whoever is player i ∈ {1, … , n} . We distinguish the following cases: Case i = 1 . The thesis directly derives from (7) and s i ≥ 0 . In particular, we do not need (6), which does not apply to i = 1.
Case i = n . Since r n > 0 by condition (i), we have that s n is at most n − 2 . Replacing i with n and s n with n − 2 in (5) yields m − 1 ≥ 2(n − 1) and hence the thesis.
Case i = n − 1 . By condition (ii), it holds that s n−1 + r n−1 < s n . Moreover, since r n−1 > 0 and s n is at most n − 1 , it follows that s n−1 is at most n − 3 , which means that the inequality (5) yields m − 1 ≥ 3n − 6 . Then, the thesis derives from the fact that 3n − 6 > 2(n − 1) − 1 for all n ≥ 4.
Case 3 ≤ i ≤ n − 2 . First, we have from (6) and (7) that After some algebra, we obtain Let f(i) be the left-hand side of (8), where i is upgraded to real values. Since f(i) is a convex parabolic function, for any three values x < y < z , f(y) is greater than the minimum of f(x) and f(z). Therefore, if f(3) and f (n − 2) are greater than 2(n − 1) − 1 , then so is f(i), for all 3 ≤ i ≤ n − 2 . It is straightforward to see that both the conditions f (3) > 2(n − 1) − 1 and f (n − 2) > 2(n − 1) − 1 hold for all n ≥ 5 . Hence, the thesis. ◻

Admissible preferences
The main results in the previous section rely on the assumption that preferences are admissible. This naturally raises the question: how general is such a notion? In this section, we address this issue by presenting a large class of admissible preferences that are based on linear utilities. On the other hand, we also emphasize the limits of such a notion by showing a rather simple preference that is not admissible. Thereafter, a (⪯) = {b ∈ A | a ≺ b} is the set of players that have a better placement than a in the ranking ⪯ , a (⪯) = {b ∈ A | a ∼ b} is the set of players having the same placement as a (including a itself), and a (⪯) = {b ∈ A | b ≺ a} is the set of players with a worse placement than a. Moreover, let U B , U S , and U W be three functions from A to real values subject to the constraint that is the utility associated to b having a better placement than a. In normal circumstances U B (b) is likely to be negative. Similarly, U S (b) is the utility of having b ranked the same as a and finally U W (b) applies when b is ranked worse than a; normally it is a positive value. A linear utility U a over rankings is then defined as follows We say that the linear utility U a induces the preference relation P lin a defined by P lin

Example 6 Consider a round-robin point-based tournament between players a, b, and c
where a has more rivalry with c than with b. More precisely, the preference of player a is represented by a linear utility U a with U W (b) = 1 , U W (c) = 2 , U B (b) = −1 , U B (c) = −2 , and S equals to the constant function 0.
Then, U a induces five equivalence classes shown in the following table: where the utility values of C a 1 -C a 5 are respectively −3 , −1 , 0, +1 , and 3.

Theorem 8 All preference relations induced by linear utilities are admissible.
Proof Let P lin a be a preference relation induced by a linear utility U a . We show that P lin a refines WDom a and its asymmetric part refines Dom a . Assume that ⪯ 1 and ⪯ 2 are two rankings such that WDom a (⪯ 1 , ⪯ 2 ) holds. By definition, the following inclusions hold: Let b be a player, we show that its contribution to the utility U a (⪯ 2 ) is at least as large as its contribution to U a (⪯ 1 ) . If b ∈ a (⪯ 1 ) , by (10) we have that b ∈ a (⪯ 2 ) and hence its contribution U S (b) is exactly the same in the two utilities. If instead b ∈ a (⪯ 1 ) , by (9) we have that b is either in a (⪯ 2 ) or in a (⪯ 2 ) , and since U W (b) > U S (b) its contribution to U a (⪯ 2 ) is greater than or equal to the one to U a (⪯ 1 ) . Finally, if b ∈ a (⪯ 1 ) , considering that U B (b) is the least possible utility for player b, its contribution can only increase when moving to U a (⪯ 2 ) . Since this argument holds for all players b, we obtain that U a (⪯ 1 ) ≤ U a (⪯ 2 ) and hence P lin a (⪯ 1 , ⪯ 2 ).

Page 20 of 34
Next, assume that Dom a (⪯ 1 , ⪯ 2 ) holds. By definition, WDom a (⪯ 1 , ⪯ 2 ) also holds, and by the above argument U a (⪯ 1 ) ≤ U a (⪯ 2 ) . It remains to prove that the above inequality is strict. We follow the two cases in the definition of Dom . First, assume there is a player b such that a ≺ 1 b and b ⪯ 2 a . In other words, b ∈ a (⪯ 1 ) and b ∈ a (⪯ 2 ) ∪ a (⪯ 2 ) . So, its contribution to U a (⪯ 2 ) is strictly greater than its contribution to U a (⪯ 1 ) , which proves our thesis. The argument for the other case (namely, a ⪯ 1 b and b ≺ 2 a ) is analogous. ◻ Example 7 A notable preference relation that is induced by a linear utility is the lexicographic preference: player a prefers ⪯ 2 to ⪯ 1 if there are fewer players above a in the former ranking or, those being equal, the number of ties is smaller. More formally, a prefers ⪯ 2 to ⪯ 1 , written P lex a (⪯ 1 , ⪯ 2 ) , iff: Let n be the number of players, it is straightforward to see that P lex a is induced by the utility function U lex a where U B , U S , and U W are constant functions yielding respectively −n , −1 , and 0.
Linear utilities provide a large class of admissible preferences, however as we show in the next theorem they do not fully capture the notion of admissibility.

Theorem 9 There exists an admissible preference that is not induced by any linear utility.
Proof Consider a round-robin point-based tournament T among five players {a, b, c, d, e} .
Since (0, 1, 2, 3, 4) is a possible score vector, by symmetry each linear order among the players is the label of some leaf. Hence, the following four rankings can be found in some of the leaves from T : We prove that there exists an admissible preference P c such that P c (⪯ 1 , ⪯ 2 ) and P c (⪯ 3 , ⪯ 4 ) . First, consider any linear utility that puts in the same class C 2,c,2 all and only the rankings where two players are lower than c and two players are above c. For example, by choosing U W (⋅) = 10 , U S (⋅) = 0 , and U B (⋅) = −1 , we obtain C 2,c,2 as the class whose utility value is 18. By Theorem 8, the resulting preference P is admissible. Now, modify P so that it is still a weak order, but it partitions class C 2,c,2 into two adjacent levels in the weak order (two equivalence classes): in the lower class C low , the two players below c are either a and b or e and d; the upper class C upp contains the remaining rankings. In particular, ⪯ 1 and ⪯ 3 belong to the lower class and ⪯ 2 and ⪯ 4 belong to the upper class. Let P c be the modified preference, it remains to prove that it is still admissible. This follows from the fact that, for each pair of rankings ⪯ , ⪯ � in the lower and upper class, respectively, there is no dominance relation between them; that is, neither WDom c (⪯, ⪯ � ) nor WDom c (⪯ � , ⪯) holds.
Next, assume by contradiction that P c is induced by a linear utility. Then, from P c (⪯ 1 , ⪯ 2 ) and P c (⪯ 3 , ⪯ 4 ) it follows that there exist three real-valued functions U W , U S , and U B such that From the first inequality we have that Both Theorems 8 and 9 advocate the generality of our notion of admissibility. However, not all the preferences that can be reasonably adopted by a player are admissible. Consider, for instance, the preference P pos which relaxes P lex a by ignoring ties. Formally, player a prefers ⪯ 2 to ⪯ 1 , denoted by P pos

Theorem 10
The preference P pos is not admissible.
Proof Consider again a round-robin point-based tournament of five players (a, b, c, d, and e) and the following two score vectors: The first score vector induces the ranking a ≺ 1 b ∼ 1 c ≺ 1 d ∼ 1 e whereas the second one corresponds to a ≺ 2 b ≺ 2 c ≺ 2 d ≺ 2 e . Notice that e (⪯ 1 ) = e (⪯ 2 ) = � and hence, according to P pos e , ⪯ 1 and ⪯ 2 are equivalent. However, by definition Dom e (⪯ 1 , ⪯ 2 ) holds. Consequently, all admissible preferences for player e consider ⪯ 2 strictly better than ⪯ 1 . ◻

Existence of relevant tournaments
In this section we investigate the possibility to design point-based round-robin tournaments which promote relevance. First, we prove that, in static tournaments, relevance is unfeasible quite soon ( n ≥ 5 ). Then, we consider dynamic tournaments and show that it is possible to avoid irrelevant matches. Unfortunately, the proposed method is not balanced. Finally, we prove that balanced strongly relevant tournaments exist only for n = 4.
Remark In many team sports, like football or basket, tournaments last for an entire season and matches are disputed in huge stadium across the country. Clearly, for economic and logistic reasons, this kind of tournament requires a fixed calendar to be settled beforehand. Nevertheless, many individual sports (e.g., fencing or e-sports), are typically held in a single venue and last for 1-2 days. In these cases there is no practical obstacle to implementing dynamic point-based round-robin tournaments.

Static tournaments
First, we show that if n ≤ 4 , then there exists a static point-based round-robin tournament that is balanced and strongly relevant.

Theorem 11
If n ≤ 4 , then there exists a static point-based round-robin tournament T that is strongly relevant. Moreover, in case n = 4 , T is also balanced.
Proof For n = 3 , it is straightforward to see that all six possible static tournaments are strongly relevant. Let n = 4 and consider the static tournament T given by the sequence of the following matches: {a, b} , {c, d} , {a, d} , {b, c} , {a, c} , {b, d} . Then, it can be proved by inspection that T is strongly relevant. Notice that T is also balanced. ◻ The following theorem states that, in every round-robin tournament for at least 5 players that is static and point-based, there is a match that is irrelevant for both of the involved players.

Theorem 12 For all n ≥ 5 , there is no point-based round-robin tournament that is static and weakly relevant.
Proof Then, let n ≥ 5 . Since the tournament is static, there is a match, say (i, j), that is played last in all paths. Consider a path, starting from the root, in which i wins all matches, j loses all matches, and the other n − 2 players win approximately half of their games, leading to a node x, where only the match (i, j) remains to be played. At x, player i has score n − 2 , player j has score 0, and the other players have score approximately equal to n−1 2 . Precisely, if n is odd then all other players have score n−1 2 , otherwise some of them have score ⌊ n−1 2 ⌋ and some have score ⌈ n−1 2 ⌉ . It is easy to prove that this is indeed a valid scenario. 6 We prove that neither i nor j can change their ranking in their last game. Since n ≥ 5 , ⌊ n−1 2 ⌋ ≥ 2 , so even if player j wins the last match, its ranking will still be the the last of all. Dually, ⌈ n−1 2 ⌉ ≤ n − 3 , so even if player i loses the last match, its ranking will be the first of all. Notice that the latter argument does not hold for n ≤ 4 . ◻ Example 8 For n = 5 , the scenario described in Theorem 12 leads to the score vector (s 1 , … , s 5 ) = (0, 2, 2, 2, 3) , where the last match is between players 1 and 5. Clearly, those players cannot modify their ranking as a consequence of their last match.

Weakly relevant dynamic tournaments
We describe a family T(n) of dynamic round-robin point-based tournaments that are weakly relevant, for all numbers n of players. In the following, for a score vector (s 1 , … , s n ) , we say that the vector ( 0 , … , n−1 ) is the corresponding score difference vector, where 0 = s 1 and i = s i+1 − s i for all i = 1, … , n − 1.
Let T(2) be the trivial round-robin tournament between 2 players, T(n + 1) is recursively defined as follows. First, players 1, … , n play T(n) (first phase), resulting in a score vector (s 1 , … , s n ) and score differences ( 0 , … , n−1 ) . We partition the players into two sets: The second phase of the tournament consists in all matches involving player n + 1 . First, we let n + 1 play against all players in + , in any order. Then, we schedule the remaining matches, in any order. a recursive tournament among the players {a, b, c, d, e} where the first phase consists in a tournament T(4) among the first four players. Then, consider as possible outcomes of the first phase the score vectors u = (0, 2, 2, 2) and v = (1, 1, 2, 2) , where scores are assigned, from left to right, to a, b, c, and d. By construction, in the first case 0 = {b, c} and + = {a, d} , whereas in the second case 0 = {a, c} and + = {b, d} . Consequently, in the first case the match (a, e) will precede the match (b, e) whereas in the second case the opposite holds.

Example 9 Let T(5) be
This shows that different outcomes of T(4) dynamically induce different schedules in the second phase. In particular, a possible schedule for the second case (score vector v) requires e to challenge the other players in the following order: b, d, c, and a. If we used such a schedule in the first case (where T(4) ends with the score vector u) and e beat b, d, and c, then the scores before the last match (e, a) would be: and hence the last match would be irrelevant for both a and e.
The intuition behind the recursive tournament T(n + 1) is the following. Players in 0 are "safe" in the sense that, when they will play against n + 1 , the match will be relevant for them. The other players are "unsafe" in the same sense. Hence, we first schedule the unsafe matches, because they are certainly relevant for n + 1 (as a consequence of the next Lemma 4). Then, we schedule the remaining matches, that will be relevant for the other player.

Lemma 4
Assume that the sub-tournament T(n) ends with a score vector (u 1 , … , u n ) and a maximum score difference max . For all i = 0, … , n − 1 such that i ≤ u n and (n − i) > max , the (i + 1)-th match of the second phase is relevant for player n + 1.
We can now prove the main result of this section.

Theorem 13
The recursive tournament scheme T(n + 1) is weakly relevant, for all n ≥ 1.
Proof Assume by induction that the sub-tournament T(n) is weakly relevant.
First, we prove that the nodes in T(n) are still weakly relevant when considered as nodes in the first phase of T(n + 1) . Consider a node x in T(n) labeled with (a, b) and assume that x is t-relevant in T(n), for t ∈ {a, b} . By Theorem 4, x is t-important in T(n). Hence, there is a path from x in T(n) whose ranking is not t-equivalent to the ranking of the a b c d e 0 2 2 2 3 5 Page 24 of 34 homologous path starting from x . Now, both and can be prolonged assuming that agent n + 1 wins all matches in the second phase of T(n + 1) . Notice that the two prolonged paths are homologous. Moreover, at the end of the two prolonged paths, all agents except n + 1 have the same points that they had at the end of and , respectively. Therefore, x is t-important and weakly relevant in T(n + 1).
Next, we prove that the matches in the second phase are also weakly relevant. Assume that the sub-tournament T(n) ends with score vector (s 1 , … , s n ) and score differences ( 0 , … , n−1 ) . Partition the agents into 0 and + , as explained earlier. The second phase first performs all matches between agent n + 1 and each agent in + .
Notice that the maximum i satisfying Lemma 4 is ̂= min{s n , n − max − 1} . That lemma ensures that the first ̂+ 1 matches in the second phase are relevant for agent n + 1 . Let r =̂+ 1 = min{s n + 1, n − max } , we prove that r is at least equal to the number | + | of unsafe agents.
First case: r = s n + 1 . Write s n as s 1 + ∑ n−1 i=1 i . Notice that each agent j in + has j ≥ 1 , so Second case: r = n − max . By Lemma 2 applied to max , we have that | 0 | ≥ max . Hence, | + | = n − | 0 | ≤ n − max = r and we are done. It follows that all matches between n + 1 and one of the agents in + are relevant for n + 1.
Since r ≥ | + | , all matches of agent n + 1 with an agent of + will be relevant for n + 1 . It remains to evaluate the matches between agent n + 1 and the agents in 0 . Let x be a node corresponding to such a match, involving agents n + 1 and a ∈ 0 , and let u j be the score of a at the end of T(n). Since a ∈ 0 , there exists at least one other agent b having at the end of T(n) the same score u j . Note that in x s b (x) is either u j or u j + 1 . Since r a (x) = 1 , we have that a (x) ≥ 1 + u j − u j − 1 ≥ 0 and hence x is relevant for a. In conclusion, the whole tournament is weakly relevant. ◻ It is an open problem whether there exist strongly relevant round-robin point-based tournaments for arbitrarily large n.

Balanced tournaments
The tournament described in Sect. 6.2 is poorly balanced, in the sense that a player may be put on hold for a long time, and then be asked to play all of its matches in a row. Clearly, this may be undesirable since that player would be physically and cognitively stressed in a short time span. 7 Conversely, we would like all players to play equally often, or at least approximately so.
Recall from Sect. 2 that a round-robin balanced tournament with n players is organized into n − 1 rounds, during which each player is involved in a single match. This structure is reminiscent of team tournaments that follow a regular, often weekly, schedule, with each team challenging another team every week. Unfortunately, the following result states that being balanced in this sense is incompatible with being strongly relevant. Proof Let u be the score vector (0, n 2 , n 2 , … , n 2 ) . It is straightforward to prove that this is a valid score vector according to Theorem 2. Consider an arbitrary round-robin point-based balanced tournament T . By Lemma 1, there is a full path in T such that u is its score vector. Let i be the player having score 0 at the end of . Consider the last event involving player i in , and let x be the corresponding node. We know that i loses the match at x, because it will end up with score 0. We prove that the score vector at x is of the type (0, n 2 − 1, …) . First, player i has score 0 at x because scores are non-decreasing in time. Then, by definition of balanced tournament, x is one of the last n 2 nodes in . Consequently, between x and the end of each player plays at most one match. So, the score of each player at x is either equal to its final score, or to its final score minus one. In particular, the opponent of i at x is one of the players whose score increases by one. This implies that the lowest non-zero score at x is n 2 − 1. To prove that x is not i-relevant, it is sufficient to observe that, no matter whether i wins or loses at x, in all leaves i ends up with score at most 1, corresponding to minimum rank. ◻ Remark In some real-world situations, each round in a tournament consists of multiple matches that are disputed in parallel. Typically, for n even, we have n − 1 rounds of n 2 simultaneous matches. Notice that this kind of tournaments are inherently balanced and, since score vectors do not depend on how tournaments are scheduled, each parallel tournament can possibly end with the score vector (0, n 2 , n 2 , … , n 2 ) . Then, the proof of Theorem 14 can be repeated without any substantial change. In particular, in the last round there will be a player with score 0 that challenges a player with score greater than or equal to n 2 − 1 . Consequently, no point-based round-robin parallel tournament with n ≥ 6 is strongly relevant.

Strongly relevant dynamic tournaments
Section 6.2 provides a general schema for a weakly relevant tournament with any number of participants. On the other hand, we do not know whether strongly relevant tournaments always exist. Thus, in this section we focus on small numbers of participants, at most eight, and search for strongly relevant tournaments algorithmically.
Since the number of different round-robin tournaments for n players is finite, we could exhaustively generate all of them, until a strongly relevant one is found, if any. However, the number of different dynamic tournaments for n players is and hence, roughly speaking, it is doubly exponential in n squared. For example, for 7 players we have more than 10 10 5 tournaments. Even checking 1 billion tournaments per second, it would take more than the age of the universe to check them all. Moreover, even with the help of Theorem 5, checking whether a single tournament T is strongly relevant requires to compute the a values at each internal node and hence it is exponential in the depth of T . Clearly, such a naive approach is infeasible even for small values of n. We generate tournaments incrementally by choosing at each node one of the remaining matches and testing whether the resulting children are strongly relevant or not, a process that we call expanding a tournament. When a non-strongly-relevant node is found, we do not discard all nodes built so far; instead, we backtrack to its ancestors until a different match can be chosen. Clearly, the search benefits from any criterion capable of predicting in advance the presence of non-strongly-relevant nodes. Indeed, we use the three conditions in Theorem 6 to backtrack as soon as possible and hence reduce the number of generated nodes.
For the sake of readability, we first provide in Algorithm 1 an abstract description of our searching procedure.
is a recursive procedure that takes as input a node x and returns if a strongly relevant tournament rooted at x is found, and otherwise. At the implementation level, a node x is a compound structure that records: (i) the current score vector, (ii) the and values and the number of remaining matches of each player, (iii) the set of unplayed matches, and (iv) the level of x in the tournament.
If x is a final node, that is the number of remaining matches is 0 for all players, then returns (line 2). Otherwise, scans the set of unplayed matches x.unplayed for a next match (lines 3-12). In lines 4-6, an unplayed match {a, b} is extracted and the algorithm generates the representations of the two children of x, corresponding to a (resp. b) having won the current match. Then, line 7 checks the assumptions of Theorem 6. If one of x a and x b is doomed (that is, it satisfies one of the three conditions in Theorem 6) we know that the match {a, b} leads to a non-strongly-relevant node. Then, moves on to another unplayed match without expanding x a or x b further (aka local backtrack). If neither x a nor x b is doomed, Theorem 5 ensures that both of those nodes are strongly relevant and hence need to be expanded by recursively invoking on them. If both calls return , the algorithm reports success to the caller. If none of the unplayed matches succeeds, the algorithm reports failure (aka non-local backtrack).  Fig. 4 Experimental results of : running time, number of generated nodes and ratio between the number of generated nodes and the optimal number of nodes

Optimizations
We then exploit several techniques to further speed up the search, leading to a positive answer within a reasonable amount of time for all n ≤ 8 (see Fig. 4).
Symmetry. Since at the beginning all players have zero points and n − 1 matches to carry out against all the other players, by symmetry the choice of the first match and of its outcome are inconsequential. Hence, is called on an initial node where the first match and its outcome are set with arbitrary values. Note that fixing the players involved in the first match reduces the number of tournaments to be considered by n 2 . Moreover, fixing the outcome of the first match halves the number of nodes to be generated, because only half of each tournament needs to be explored.
Parallelism. First of all, the tree structure of a tournament ensures that if two nodes x and x ′ are not on the same path, then (x) and (x � ) are independent computations which can be executed in parallel. Therefore, the recursive calls in are executed by separate threads, up to a given level of the tournament. Tuning this threshold allows us to choose a desired degree of parallelism. In our experiments, due to the architectural specifications, we set the threshold to 3 and hence the maximum number of parallel threads to 8. Multi-threading allows to run three times faster.
First-match heuristic. To speed up generation of new nodes and save memory, we ordered matches lexicographically and represent the set of available matches, x.unplayed , by a bit vector. We also adopted a specific heuristic while extracting a match from x.unplayed . Intuitively, if a match is a good choice for a node x then it would be probably a good choice for neighbouring nodes at the same level. More specifically, when is called on a node at level l and one of the unplayed matches m succeeds (that is, it passes both checks in lines 7 and 8), then before returning associates m to l in a per-thread mapping lvl_heur_choice . Consequently, lvl_heur_choice maintains the last successful match (if any) for each level. Then, the next call to on a node at level l will check whether m is unplayed at that node, and if so it will choose m as the first match to be extracted.
Fail-fast match evaluation. Furthermore, since the conditions in Theorem 6 can be checked player by player, we merged in a single procedure the children generation in lines 5-6 and the admissibility check in line 7. More specifically, the score vector of a child is computed first, then starting the values of and are computed one player at a time and simultaneously the three conditions in Theorem 6 are checked. As soon as a player satisfies one of these conditions, stops updating the remaining players and jumps to the next match in x.unplayed . In this way, the combined generation-and-test phase can be performed in linear time in the number of players.

Experimental results
We run the resulting algorithm on a PC based on AMD Ryzen 7 2700X CPU (8 cores/16 threads) clocked at 3.7 GHz with 16 GB of RAM.
When the number of players ranges from 5 to 8 the algorithm finds a strongly relevant tournament. The first two rows in Fig. 4 show the execution time and the total number of generated nodes for each choice of player number. Both grow by several orders of magnitude for each extra player. Indeed, with 9 players the algorithm does not terminate within a reasonable amount of time (more than 14 days).
The third row in Fig. 4 reports the ratio between the number of generated nodes and the optimal number of nodes. The latter is equal to corresponding to the case where a   13  14  15  16  17  18  19  20  21  40  149  570  2743  8970  21163  29275  32362  3369   level  local backtracks  non-local backtracks  0  51  386  1495  3770  6224  7990  strongly relevant tournament is found right away with no backtracking. 8 For example, for 5 players the optimal number of nodes is 1023; meaning that generates, approximately, only 100 additional nodes-hence, backtracking is limited to few cases. This ratio is relatively stable for 6 and 7 players, but jumps by an order of magnitude for 8 players. Figure 5 shows, level by level, the number of local and non-local backtracks for 7 players (and hence 21 matches). Up to level 12, no backtracking occurs. On level 13 the number of backtracks is 40; fortunately they are all detected locally so they do not notably burden the performances. From level 14, non-local backtracks constantly increase (with the obvious exception of level 21); however they are always fewer than the local ones. The total number of generated nodes is about 2.7 million nodes.
Concerning local backtracks, we have considered a simpler check in line 7, verifying the first condition of Theorem 6 only. Doing so, the number of generated nodes grows to 37 millions. This shows that the second and third conditions in Theorem 6 occur frequently enough to positively impact on performances.

Conclusions
In this paper we investigate the problem of designing point-based round-robin tournaments where irrelevant matches never occur. In particular, we introduced two different notions of relevance, depending on whether at least one of the players involved in a match is motivated to win (weak relevance) or both of them (strong relevance). We also consider four different classes of tournaments, which differ on whether the scheduling process is established a-priori (static) or depends on past events (dynamic), and whether the matches involving a certain player are adequately balanced over the entire sequence of matches. Figure 6 gives a quick overview of the positive and negative results. Static tournaments cannot prevent the presence of irrelevant matches even in the case of 5 participants. For balanced dynamic tournaments, strong relevance fails starting with 6 participants, whereas weak relevance can be assured by unbalanced dynamic tournaments no matter how many players are participating. It is still unknown whether the previous result can be extended to balanced dynamic tournaments. Moreover, we algorithmically verified the existence of strongly relevant tournaments for up to 8 players. However, it is an open issue whether such result holds for arbitrarily large numbers of players, although we know that, if strongly relevant tournaments exist, they cannot be balanced (Theorem 14).
Even in the scope of negative results, future refined analyses may be able to quantify the amount (or likelihood) of relevant matches, and suggest ways to maximize them. This could be useful in case of popular team sports where only static tournaments can be implemented in practice.
The present model can be extended in various directions. For instance, it would be interesting to accommodate more than two possible outcomes for each match, as sport matches often have multiple outcomes. The simplest addition would be the "tie" outcome. In that case, negative results based on the irrelevance of the last match, such as Theorem 12, should easily carry over to the extended model.
An orthogonal extension is to tournaments with simultaneous matches. In particular, a common occurrence in practice is the type of tournaments where every week all players 8 A tournament consists of 2 n 2 +1 − 1 nodes, however as mentioned above we set the outcome of the first match to a default value, so only half of each tournament needs to be explored. play against each other simultaneously. Interestingly, simultaneity induces two opposing consequences on match relevance. On the one hand, it restricts the number and type of schedules available, which can in principle hinder relevance. On the other hand, if two matches x and y are played simultaneously, when proving the relevance of x we can freely choose the outcome of y, and vice versa. We have shown in Sect. 6.3 that this ability does not guarantee strong relevance (for n ≥ 6 ). However, it could facilitate weak relevance. Finally, we did not specifically consider the class of double round-robin tournaments, in which every player challenges each other twice. This class has special practical relevance, as it is employed in a vast majority of team sports. Some results can easily be extended to this class. For instance, it is easy to prove, along the lines of Theorem 12, that for at least three players no static double round-robin tournament is strongly relevant.
Funding Open access funding provided by Università degli Studi di Napoli Federico II within the CRUI-CARE Agreement.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creat iveco mmons .org/licen ses/by/4.0/. Proof By definition, u is induced by a full path u from a round-robin tournament T u . Consider the full path in T that is homologous to u . Such a path exists because all full paths in all round-robin tournaments with n players contain the same matches, only in a different order. As the events in are a permutation of the events in u , every player wins the same number of matches in as in u . Hence, u is the score vector of . Proof Let s be a score vector, be its score difference vector, and 0 = {i | i = 0} be the set of (indices of) plateaus. Assume that i is an index s.t. i > 1 . For all 1 ≤ j ≤ k ≤ n , let S j,k = ∑ k l=j s l . We have S 1,n = S 1,i + S i+1,n = n 2 . We can write S i+1,n as s i (n − i) + h . By Landau's theorem, S 1,i ≥ i 2 . It follows that We distinguish two cases. First, assume that s i ≥ i − 1 (see Fig. 7 for an illustration). By (11), h ≤   The score vector is  (0, 3, 3, 3, 3, 3, 7, 7, 8, 8), with i = 6 . We have i = 4 , four plateaus before position i and two more plateaus after it