League competitions and fairness

We formulate two fairness principles and characterize the league competition systems that satisfy them. The first principle requires that all players should have the same chance of being the final winner if all players are equally strong, while the second states that the league competition should not favor weaker players. We apply these requirements to a class of systems which includes round-robin tournaments as a particular case.

competition rules may be set with many different objectives in mind, such as match intensity, attracting the interest of the spectators (cf. Dagaev and Suzdaltsev 2018), minimizing organizational costs, and so on. Fairness is, or should be, certainly one the main goals of any competition designer. Moreover, as outlined in Bartsch et al. (2006), in real world-sport leagues, fairness issues are quite important.
In a league competition, every player participates in a given number of matches against other players. A certain number of points is assigned to the winner of each match, and the final winner is the player with the most points.
The most widely used leagues are "single round-robin tournaments", where each player plays against every other player once, and "double round-robin tournaments", where each player plays against every other player twice (cf. Rasmussen and Trick 2008). Regular seasons in most sports have a league structure. However, there are well-known examples of leagues that are not round-robin tournaments, e.g. the US National Football League (NFL), where each team plays 16 matches in the regular season but does not play the same number of times against every opponent and does not play at all against some teams. In the US National Basketball Association (NBA) each team plays 82 matches in the regular season and plays against every other team, but does not play the same number of matches against every opponent.
Leagues where different players play different number of matches are more difficult to find. However we believe that this possibility should not be disregarded, at least at the theoretical stage. The same principle that supports giving byes in knockout tournaments (favoring more meritorious participants) could be applied to leagues, so that certain players gain an advantage by playing more matches. It should be noted that such an advantage is given if points are assigned only for winning matches, though there are exceptions to this rule. For instance, a bye can be awarded the same number of points as for winning a match in Swiss-system tournaments with an odd number of players. 1 We nevertheless include the mentioned theoretical possibility of gaining by playing more matches in our formal model, if only to investigate its implications. Recent proposals to change standard round-robin domestic leagues in football also support the pertinence of such a more general analysis (cf. Feehely 2021). We refer the reader to Lasek and Gagolewski (2018) for an overview of tournament formats used in the majority of European top-tier association football competitions as well as to Csató (2020) for the relationship between the existence of ground-robin groups of different strength in tournaments and the quality of matches in the corresponding competitions.
Many of the discussions about fairness in competition systems are based on rather informal arguments. In this paper we offer a formal setup within which such discussions can be framed and precisely define two fairness principles that are commonly pursued in real practice. The first principle requires a competition system not to favor weaker players (we refer to this as "monotonicity in strength"), and the second requires that all players should have the same chance of being the final winner if all players are equally strong ("equal treatment"). Our main purpose is thus to study the extent to which league-type competition systems can be considered fair according to these principles.

Literature overview
There are several papers on modeling and studying fairness in league-type competition systems. One possibility is to focus on the influence of scheduling in sequential round-robin tournaments (cf. Durán et al. 2017, Krumer and Lechner 2017, Sahm 2019, including carry-over effects (cf. Russell 1980, Lambrechts et al. 2018 or on the requirement that a team should not play against extremely weak or extremely strong teams in consecutive periods (cf. Briskorn 2009, Briskorn and Knust 2010, Nemhauser and Trick 1998. Moon and Pullman (1970) concentrate on "equalizing" handicapping methods. Rubinstein (1980) shows axiomatically that the points system used in round-robin competitions is the only one that satisfies three axioms inspired by social choice theory. Levin and Nalebuff (1995) draw an analogy between round-robin points systems and voting systems.
Fairness in sports has also been analyzed with respect to tie-breaking mechanisms within the field of economics (cf. Apesteguía and Palacios-Huerta 2010and Che and Hendershott 2008). Most studies that compare competition systems apply simulation techniques to check that particular properties are satisfied (cf. Appleton 1995, McGarry and Schutz 1997, Scarf et al. 2009, Ryvkin and Ortmann 2008and Ryvkin 2010. There is also a sizeable number of papers in operations research related to sports that focus on topics other than fairness and thus lie outside the scope of this study. Readers are referred to Csató (2021), Kendall and Lenten (2017), Kendall et al. (2010), Lenten and Kendall (2021),and Wright (2014) for surveys of this literature.

Our contribution
We start our analysis by formulating two basic fairness axioms. The first is an "equal treatment" requirement which states that "if all players are equally strong then all should have the same probability of being the final winner". The second is a "monotonicity in strength" condition requiring that "a weaker player should not have a higher probability of being the final winner than a stronger player".
Each of these axioms is presented in a strong form and in a weak form. The strong versions impose that a league-type competition should fulfill the property for every possible assignment of the players, while the weak forms only require that the property be fulfilled for at least one such assignment. The effect of these weak versions of the axioms was also studied in Arlegi and Dimitrov (2020) and Arlegi (2022). However, the analysis in these works is set within the framework of elimination-type competitions (knockout tournaments) which is completely different from the model of league-type competitions we develop and study in the current paper. In particular, the corresponding characterizations for the case of elimination-type competitions are heavily based on both the tree structure of the knockout tournaments and on the specific way in which the sequential structure of the competition determines players' winning probabilities.
In contrast, we study in the current paper the other main class of competitions (league-type competitions) and focus exclusively on the effect of the assignment of the players, i.e. on who is playing against whom and how many times, seeking to isolate this effect from others related to scheduling when the competition is structured sequentially. To that end, we investigate what type of league-type competitions satisfies the said fairness properties. Generally speaking, equal treatment leads to competitions where every player plays the same number of matches (Theorems 1 and 2), while monotonicity in strength drastically restricts the number of participants to two (Theorem 3). When weak monotonicity in strength is considered, the class of competitions that fulfills the property increases (Theorem 4).
The rest of the work is organized as follows. Section 2 presents the basic elements of our framework and introduces the fairness axioms. Section 3 sets out our results. Section 4 concludes and addresses possible extensions of the model. The proofs are relegated to the Appendix.

Framework
Let N be a finite set of at least two players who compete with each other by playing a total number s of matches. An assignment A is a symmetric matrix A = a i j i, j∈N with a i j being the number of matches played between players i and j. Thus, A determines the participants in each of the s matches, with ( i, j∈N a i j )/2 = s. For example, for N = {1, 2, 3, 4}, the assignment A defined by a ii = 0 and a i j = 1 for all i, j ∈ N , i = j, describes a single round-robin tournament between four players with the set of s = 6 matches being played {(1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)}. As shown below, our definition of a league allows (and the corresponding results account) for the possibility of players playing different numbers of matches.
The rest of this section describes the main ingredients of our model. These include the ordinal information about each player's relative strengths represented by a binary relation R over the player set N and the set of "winning probability matrices" that are consistent with R (Subsection 2.1), plus the notion of an assignment and the probability of each player being a final winner of a league competition (Subsection 2.2). Subsection 2.3 presents the fairness axioms, making use of all the previous formal elements.

Players' strength and winning probabilities
We follow Arlegi and Dimitrov (2020) and assume that the members of the player set N are completely ordered according to a binary relation R of strength so that, for all i, j ∈ N , i R j is interpreted as "player i is at least as strong as player j". The corresponding asymmetric and symmetric factors of R are denoted by P and I respectively, so i P j reads "i is strictly stronger than j " and i I j reads "i and j are equally strong". 2 Now assume that information is available about the probabilities of one player defeating another in a match. For i, j ∈ N , denote by p i j the corresponding probability and note the following natural connection between R and these probabilities: A player i is at least as strong as another player j if and only if p i j ≥ 0.5. Since the binary relation of strength is complete, i P j means p i j > 0.5 and i I j implies p i j = 0.5. For convenience, in what follows we order the players in N according to R; that is, if i P j then i < j (if i I j then either i < j or j < i).
We denote by P R the set of all probability matrices such that, for P ∈ P R , p i j ≥ 0.5 if and only if i R j. Moreover, we assume that each probability matrix in P R satisfies the following two conditions: These conditions are commonly used in the literature (cf. David 1963, Hwang 1982, Horen and Riezman 1985, Schwenk 2000 and taken together they are equivalent to the "strong stochastic transitivity" of the corresponding probability matrix (cf. David 1963). The crucial condition here is Condition (2 ), which states that any player is more likely to beat a weaker player than a stronger one. It is worth mentioning that, for a fixed binary relation of strength R, our fairness properties are imposed to hold for each P ∈ P R , so that no further details on these probability matrices are needed for our results.
Finally, it is easy to see that the strong stochastic transitivity of the probability matrices in P R implies that the binary relation of strength R is transitive. Moreover, for i, j, k, ∈ N the following useful interval property connecting the strength of these players to their corresponding winning probabilities emerges: (3)

Assignments and final winners
Given a league competition (s, N ), an assignment of size s ∈ Z + is a symmetric matrix A = a i j i, j∈N with a i j ∈ Z + ∪ {0} for all i, j ∈ N being the number of matches played between players i and j such that: • a ii = 0 for each i ∈ N (no player plays against herself); • j∈N a i j > 0 for each i ∈ N (each player plays at least one match); • 2 ≤ |N | ≤ i, j∈N a i j = 2s (the total number of matches is s).
The set of all assignments for N of size s satisfying the above conditions is denoted by A (s,N ) . We assume that player i ∈ N wins the competition (s, N ) at assignment A ∈ A (s,N ) if no other player wins more matches than i from the matches induced by A. Given a probability matrix P containing the probabilities of a player winning a match, we denote by ϕ i (A, P) the probability that player i ∈ N wins the competition. The exact mathematical expression of ϕ i (A, P) is provided in the Appendix and it should be noted that it does not use tie-breaking criteria (cf. Berker 2014 and Csató 2021), i.e., multiple final winners are allowed.

Fairness axioms
We now formally introduce the two fairness principles (cf. Arlegi and Dimitrov 2020). Each of these ideas is presented in a strong form and in a weak form. To state them, we assume that a binary relation R of strength is defined on the player set N .

Equal Treatment (ET) A league competition (s, N ) satisfies ET if for all
ET and WET express the idea that in regard to the final probability of winning, the competition system should not be biased towards any particular player if all of them are equally skilled.
MS and WMS require the competition system not to reward weaker players under any of the possible probability matrices compatible with the strength of the players. In fact, many tournaments are precisely designed to minimize the role of luck in winning the competition: For example, round-robin tournaments and even double round-robin tournaments minimize that effect by staging a large number of matches, and in knockout tournaments the strongest player is often matched with the weakest, the second strongest with the second weakest, and so on.
Apart from the fact that WET is logically weaker than ET and WMS is logically weaker than MS, the normative power of the weaker versions compared to the strong versions may depend on the specific application intended, and in particular on the conjectures as to the benevolence of the competition designer. On the one hand, ET and MS prevent manipulation by a potentially corrupted competition designer because they ensure that there exists no assignment rule benefiting a particular player in relation to another one who is more or equally skilled. On the other hand, WET and WMS rely on confidence in the benevolence of the competition designer, in the sense that the focus is on competition systems where it is always possible to find an assignment rule that is fair, independently of the values in the probability matrices supporting the strength relation.
In formulating the monotonicity properties we were guided by the general view that the information on the exact values of the probabilities of winning might be rather imprecise. A consistent way of incorporating such a view into the corresponding requirements is to require them to hold for all probability matrices. Clearly, MS and WMS would then guarantee fairness for all possible probability values which are compatible with the binary relation of strength R. This is also important from a practical perspective as the rules used for assignment in most professional sports playoffs are usually proxies of R obtained on the basis of end-of-season standings. Hence, it is important to know whether the corresponding competition structure is fair independently of the precise numerical scores that describe the strength of the teams at the end of the regular season.

Leagues and equal treatment
Whether the two equal treatment axioms (ET and WET) are fulfilled by league competitions is closely related to the fact that players should play the same number of matches. The first result in this section shows that a league satisfies ET if and only if either each player plays a single match or only two players play all matches. Clearly, both cases imply that there must be an even number of players participating in the competition.

Theorem 1 A league competition (s, N ) satisfies ET if and only if either 2s
It is sometimes suggested that leagues are fair competition systems. However, this is not true in our framework because our definition of league is much broader than the sense in which the term is popularly used, which is usually identified with roundrobin tournaments. In fact, the theorem given above excludes leagues as fair structures unless every player plays exactly one match or there are only two players. We now show that weakening ET to WET extends the class of fair league competitions by including those competitions where each player plays the same number of matches against every other player.

Theorem 2 Any league competition
It should be noted that Theorem 2 is not superfluous in the sense that not every league competition satisfies WET. For example, it can easily be checked that there is no way to assign three players to a two-match competition so that WET is fulfilled.

Leagues and monotonicity in strength
Our next result shows that MS restricts the number of players in a competition to only two.

Theorem 3 A league competition (s, N ) satisfies MS if and only if |N | = 2
When MS is weakened to WMS, the class of fair competition systems is considerably enlarged because any league competition turns out to satisfy this axiom provided that either each player participates in exactly one match or the total number of matches is at least (|N | − 1). In particular, this implies that any league competition covered by Theorem 2 satisfies the weak versions of both the equal treatment and monotonicity in strength properties. It is not difficult to prove that the assignment used in the proof of Theorem 4 (see the Appendix) when 2s = |N | is the only one for which (s, N ) satisfies WMS. However, there are assignments other than those used when s ≥ |N | − 1 holds for which (s, N ) satisfies WMS.
Finally, as in Theorem 2, it should be noted that Theorem 4 is not superfluous in the sense that there exist league competitions that do not satisfy WMS. For example, it can be proved that a league competition consisting of three matches and five players does not satisfy WMS.

Round-robin tournaments
Let k ≥ 1 be an integer. A k-round-robin tournament is a league competition (s, N ) together with an assignment A ∈ A (s,N ) satisfying the additional condition a i j = k for all i, j ∈ N , i = j. That is, according to A, each player in N plays exactly k matches against every other player in N . Clearly then, a single round-robin tournament requires k = 1, while a double round-robin competition implies k = 2. Notice finally that, by Given the way we introduced our axioms and the fact that a round-robin tournament is defined with respect to a specific assignment, it makes sense to check whether such a competition system satisfies WET and WMS only i.e. the relevant results are to be derived from Theorem 2 and Theorem 4.
It follows directly from Theorem 2 that the first condition in the above definition of a k-round-robin tournament is satisfied. In the proof of Theorem 2, we show further that a league competition (s, N ) with 2 s = k (|N | − 1) satisfies WET with respect to A ∈ A (s,N ) letting each player participate in exactly k number of matches against every other player. Thus, we conclude that every k-round-robin tournament satisfies WET.
As for WMS, Theorem 4 first tells us that any single round-robin tournament with two players playing exactly one match fulfills WMS. This follows from 2s = |N | which, in order to be satisfied for a k -round-robin tournament (with 2 s = k (|N | − 1) |N |), requires k = 1 and |N | = 2. Further recall that, according to Theorem 4, any league competition where the total number of matches is at least (|N | − 1) also satisfies WMS. Since the latter condition is necessary for a league competition to be a round-robin tournament, one might be tempted to conclude that round-robin tournaments also satisfy WMS. It should be noted though, that the assignment used here to prove the fulfillment of WMS in this case does not match the one in the definition of a round-robin tournament. It is highly likely that league competitions (s, N ) with 2 s = k (|N | − 1) |N | for some integer k ≥ 1 do generally satisfy WMS with respect to the round-robin tournament assignment as defined above. However, providing a formal proof is much more complex than what it may appear at first sight. 3

Conclusion
The results reported in this paper enable different league-type competition systems to be compared in terms of their fairness. In particular, we have shown that there are not many league-type competitions that are fair in the sense of simultaneously satisfying both types of fairness in their corresponding strong or weak forms. MS combined with either ET or WET produces a degenerate competition consisting of a two-player league (Theorem 3). Weakening MS to WMS and imposing it together with ET slightly enlarges the class of admissible leagues to those where each participant plays a single match. In contrast, the combination of WMS and WET results in an expansion of the class of admissible leagues to include leagues that allow players to play the same number of times in at least |N | − 1 matches (Theorems 2 and 4). An interesting direction for future research in that respect could be the quantification of the extent to which these properties are violated in certain competition formats. A first attempt in that general research direction was made in Csató (2022), where simulation techniques are used for an investigation of monotonicity and incentive compatibility properties of sports tournaments.
Theorem 2 proves that k-round-robin tournaments (which include single and double round-robin tournaments as special cases) satisfy WET. It seems quite likely that also other league-type competitions do satisfy WET; for instance, one could consider the assignment recently adopted by the UEFA Champions League from the 2024/25 season (cf. UEFA 2022), where each player plays the same number of matches against the same number of other players (not necessarily against every other player). 4 Most likely the mentioned assignments also satisfy WMS, although the formal proof remains an open question even if one restricts probabilities to take two possible values; that is, if p i j = α ∈ [0.5, 1] for all i, j ∈ N with i < j.
Our analysis in this paper does not cover Swiss-system tournaments as the assignment in the later class of tournaments, in contrast to our definition of league-type competitions, is not fixed a priori but it rather depends on the results of the matches already played. The possibility for such assignment path-dependence leads to very interesting operational research problems as how to pair the players (cf. Biró et al. 2017, Führlich et al. 2021, Kujansuu et al. 1999, Ólafsson 1990 or how to generate a players' ranking at the end of the tournament (cf. Csató (2013Csató ( , 2017).
Finally, it is worth mentioning that the strong stochastic transitivity of the probability matrices plays a crucial role in the results obtained. Any potential weakening of this condition would clearly enlarge the set of matrices that satisfy it and thus leads to a narrower class of fair competition systems.
Funding Open Access funding enabled and organized by Projekt DEAL. The authors declare that no funds, grants, or other support were received during the preparation of this manuscript.
Data Availability Not applicable.

Appendix: Proofs of the theorems
We start by introducing some additional notation and remarks. Given a competition Additionally, when the probability matrix P is such that p i j = 0.5 holds for all i, j ∈ N , we have pr (w(A)) = (0.5) s for each vector of match winners and thus, ϕ i (A, P) = (0.5) s · |W i (A)| holding for each i ∈ N . (s, N ) be a league competition with either 2s = |N | or 2 s > |N | = 2. We show first that (s, N ) satisfies ET. Let A ∈ A (s,N ) be an assignment and P the probability matrix with p i j = 0.5 for all i, j ∈ N . Notice then that either each player in N plays exactly one match (when 2s = |N |) or there are only two players who play all matches (when 2s > |N | = 2). Consider the following cases separately. Case 1 (2s > |N | = 2 and s is odd). Let N = {1, 2} and notice that in this case we have ϕ 1 (A, P) = (0.5) s · |W 1 (A)| and ϕ 2 (A, P) = (0.5) s · |W 2 (A)|. Because s is odd, . Finally, we can define a bijection f : W 1 (A)\W 2 (A) → W 2 (A)\W 1 (A) in the same way as in Case 1 and conclude that |W 1 (A)\W 2 (A)| = |W 2 (A)\W 1 (A)| should follow and thus, |W 1 (A)| = |W 2 (A)| also holds. We conclude that ϕ 1 (A, P) = ϕ 2 (A, P) and thus (s, N ) satisfies ET also in this case. Case 3 (2s = |N |). Because each player plays exactly one match in this case, for any vector w(A) of match winners, a player is the final winner of the competition only if she is the winner of the match which she is assigned by A. Thus, |W i (A)| = W j (A) holds for all i, j ∈ N . By ϕ i (A, P) = (0.5) s · |W i (A)| holding for each i ∈ N , (s, N ) satisfies ET.

Proof of Theorem 1 Let
Assume now that (s, N ) is a league competition satisfying ET. To show that either 2s = |N | or 2 s > |N | = 2 holds, let P be the probability matrix with p i j = 0.5 for all i, j ∈ N . It suffices to show that, for some assignment in A (s,N ) , 2 s > |N | > 2 leads to a contradiction (as |N | ≤ 2 s follows from (s, N ) satisfying ET and the definition of an assignment). Consider then the following possible cases. Case 1 (|N | is even and 2s = |N | + 2). Let the assignment A be such that a 12 = 2 and j∈N \{1,2} a i j = 1 for all i ∈ N \ {1, 2}, and notice that A ∈ A (s,N ) . Consider a competition system (s − 1, N ) and the assignment A ∈ A (s−1,N ) such that a 12 = 1 and a i j = a i j for all i, j ∈ N \ {1, 2}. Observe that, by 2(s − 1) = |N | and as argued in Case 3 above, W 1 (A ) = W 3 (A ) . Take w(A ) ∈ W 1 (A ) and note that this implies that player 1 wins his single match in M(A ) against player 2. Thus, for each w * (A ) ∈ W 1 (A ) there are exactly two vectors w (A), w (A) ∈ W 1 (A) of match winners for (s, N ) where, all else being equal, either player 1 wins his other match against player 2 or player 2 wins it. On the other hand, for w * * (A ) to belong to W 3 (A ) player 3 must necessarily win her single match. Thus, for each w * * (A ) ∈ W 3 (A ) there is a unique vector w (A) ∈ W 3 (A) of match winners for (s , N ) where, all else being equal, the winners of the two matches between players 1 and 2 are different. We conclude then that |W 1 (A)| > |W 3 (A)| holds and thus, by ϕ 1 (A, P) = (0.5) s · |W 1 (A)| > (0.5) s · |W 3 (A)| = ϕ 3 (A, P), we reach a contradiction to (s, N ) satisfying ET. Case 2 (|N | is even and 2 s > |N | + 2). Let A be such that a 12 = 2 s−|N | 2 + 1 and j∈N \{1,2} a i j = 1 for all i ∈ N \ {1, 2}, and notice that A ∈ A (s,N ) . Fix a vector w(A) of match winners and note that, given the definition of A, player 3 is a final winner in w(A) only if, for each i ∈ N , player i wins at most one match. However, by 2 s−|N | 2 + 1 > 2, either player 1, or player 2 or both must win more than one match. We conclude then that W 3 (A) = ∅ should hold. Meanwhile, W 1 (A) = ∅ because player 1 is a final winner of the competition if she wins all her matches. We have then ϕ 1 (A, P) = (0.5) s · |W 1 (A)| > 0 = (0.5) s · |∅| = (0.5) s · |W 3 (A)| = ϕ 3 (A, P) in contradiction to (s, N ) satisfying ET. Case 3 (|N | is odd). Let N = {1, . . . , n} and take A defined as follows: a 12 = 2s−|N |+1 2 , a 1n = 1, and j∈N \{1,2,n} a i j = 1 for all i ∈ N \ {1, 2, n}. Notice that A ∈ A (s,N ) . We proceed by considering the following three possible sub-cases. Case 3.1 ( 2 s−|N |+1 2 = 1). In this case player 1 plays exactly one match against player 2 and exactly one match against player n. Denote these matches by m 12 and m 1n , correspondingly. There are four possible combinations of winners in m 12 and m 1n : (i) 1 wins in both matches; (ii) 1 wins against 2 and loses against n; (iii) 1 loses against 2 and wins against n; and (iv) 1 loses in both matches. Notice that each player from N \ {1, 2, n} can win at most one match. Therefore, for each of the vectors of match winners in M(A) \ {m 12 , m 1n }, three out of the four possible combinations of winners in {m 12 , m 1n } give as a result a vector of match winners in W 1 (A) and only two give as a result a vector of match winners in W n (A). We conclude then that |W 1 (A)| > |W n (A)| holds and thus, by ϕ 1 (A, P) = (0.5) s · |W 1 (A)| > (0.5) s · |W n (A)| = ϕ n (A, P), we reach a contradiction to (s, N ) satisfying ET. However, by 2 s−|N |+1 2 > 2, the latter condition is violated for either player 1, or player 2, or for both players. We conclude then that W n (A) = ∅ should hold. Meanwhile, W 1 (A) = ∅ because player 1 is the winner of the competition if she wins all the matches that she plays. We have then ϕ 1 (A, P) (s, N ) be a league competition with either 2s = |N | or 2 s = k (|N | − 1) |N | for some integer k ≥ 1. Because ET is stronger than WET, it follows from Theorem 1 that (s, N ) satisfies WET when 2s = |N |.

Proof of Theorem 2 Let
Consider now the case of 2 s = k (|N | − 1) |N | for some integer k ≥ 1 and let A be the assignment where each player plays k matches against every other player from N . By 2 s = k (|N | − 1) |N |, A ∈ A (s,N ) follows. We show now that (s, N ) satisfies WET with respect to A. To that end, let P be the probability matrix with p i j = 0.5 for all i, j ∈ N , and recall that ϕ q (A, P) = (0.5) s · W q (A) holds for each q ∈ N . It suffices then to prove that the cardinality of W q (A) is the same for all q ∈ N . We proceed as follows.
Case 2 (2s > |N | = 2 and s is even). When expressing ϕ 1 (A, P) and ϕ 2 (A, P) for this case there are two differences compared to the corresponding expressions in Case 1. First, (s +1)/2 must be replaced by s/2 +1, and (s +1)/2 −−1 by s/2 −1. Second, in both expressions the probabilities of the vectors of match winners where both players, 1 and 2, are winners must be considered; that is, the term p s/2 12 + p s/2 21 must be added in both expressions. Since these vectors for player 1 and player 2 do coincide (due to s being even), the added terms are the same for both players. Thus, they cancel out when the difference between ϕ 1 (A, P) and ϕ 2 (A, P) is taken. By reproducing the same reasoning as in Case 1, we can conclude that (s, N ) satisfies MS also in this case. Now assume that (s, N ) satisfies MS. We show that |N | > 2 leads to a contradiction. Consider first the case where N = {1, 2, 3} and the probability matrix P ∈ P R is as defined below: Take the assignment A ∈ A (s,N ) defined by a 12 = 1 and a 23 = s − 1. If s = 2, then ϕ 1 (A, P) ≈ 0.5 and ϕ 2 (A, P) ≈ 1 in contradiction to p 12 > 0.5 and (s, N ) satisfying MS.
If s > 2, given A and P, we have that player 2 has a probability arbitrarily close to 1 of winning all matches except one and therefore a probability close to one of winning most of her matches. Thus, ϕ 2 (A, P) ≈ 1 and ϕ 1 (A, P) ≈ 0, again reaching a contradiction to p 12 > 0.5 and (s, N ) satisfying MS.
Next assume that |N | > 3 holds and consider a probability matrix P ∈ P R such that p 23 > 0.5 and p 3k ≈ 1 for all k ∈ N \ {1, 2}. We distinguish the following two cases.
Case 1 (2s = |N |). In this case each player participates in exactly one match according to every assignment. Take A ∈ A (s,N ) to be such that a 12 = a 34 = 1. Note that, for any vector of match winners, a player is a final winner of the entire competition only if she wins her single match according to A. Thus, ϕ 3 (A, P) ≈ 1 and ϕ 2 (A, P) ≤ 0.5 in contradiction to p 23 > 0.5 and (s, N ) satisfying MS. Case 2 (2s > |N |). Consider the assignment A ∈ A (s,N ) defined as follows: a 12 = 1, a 1 j = a 2 j = 0 for all j ∈ N \ {1, 2}, and a 3 j = 1 for each j ∈ N \ {1, 2}. Note that, according to A and P, player 3 has a probability arbitrarily close to one of winning all her matches, so she has a probability close to one of winning every match in the competition except one (the one played between players 1 and 2). Hence, ϕ 3 (A, P) ≈ 1 and ϕ 2 (A, P) ≈ 0 in contradiction to p 23 > 0.5 and (s, N ) satisfying MS.

Proof of Theorem 4
We start with the case 2 s = |N |. Let P ∈ P R be an arbitrary but fixed probability matrix and, recalling that |N | is even, consider the assignment A ∈ A (s,N ) defined for all i, j ∈ N as follows: a i j = 1 if and only if i + j = |N | + 1.
That is, A matches the best player with the worst one, the second best with the second worst, and so on. Clearly, given A, a player is a final winner in a vector of match winners if and only if she is the winner of the single match that she plays. Thus, for k ∈ N , we have ϕ k (A, P) = p kk with k ∈ N being the player such that a kk = 1. Now assume that p i j > 0.5 holds for some i, j ∈ N . It needs to be shown that ϕ i (A, P) ≥ ϕ j (A, P) follows in such a case. To that end, let i , j ∈ N be such that a ii = a j j = 1. If i = j, then ϕ i (A, P) = p i j > p ji = ϕ j (A, P) follows. If i = j, we have from p i j > 0.5 that i R j holds, while j Ri holds due to the construction of A. Thus, p ii ≥ p j j follows by (3). We then have ϕ i (A, P) = p ii ≥ p j j = ϕ j (A, P) as required for showing that (s, N ) satisfies WMS with respect to A.
Now consider a league (s, N ) such that s ≥ |N | − 1 holds. Fix a probability matrix P ∈ P R and consider the assignment A defined as follows: a 12 = s − |N | + 2, a i j = 1, if i = 1 and j = 2, a i j = 0, if i = 1.
According to the above assignment, -player 1 plays all s matches (due to a 12 + (|N | − 2) · 1 = s), -each of the remaining players (except player 2) participates in exactly one match (which is, of course, against player 1), and -player 2 meets player 1 in each of the remaining (s − |N | + 2) matches of the competition.
Clearly, A ∈ A (s,N ) follows. We show that (s, N ) satisfies WMS with respect to A in three steps. Below, M 12 (A) stands for the set of (s − |N | + 2) matches played between 1 and 2 according to A.
Step 1 If p 12 > 0.5, then ϕ 1 (A, P) ≥ ϕ 2 (A, P). Finally, note that, by w(A) ∈ W 2 (A), in w(A) player 2 wins at least as many matches against player 1 as player 1 against player 2; that is,