pith. sign in

arxiv: 2109.13785 · v11 · pith:BYCS6LHInew · submitted 2021-09-28 · ⚛️ physics.soc-ph · stat.AP

Reducing the non-uniformity of the group draw in sports tournaments

L\'aszl\'o Csat\'o This is my paper

Pith reviewed 2026-05-25 08:26 UTC · model grok-4.3

classification ⚛️ physics.soc-ph stat.AP
keywords group drawsports tournamentsSkip mechanismnon-uniform distributionpot orderingdraw constraintstournament balanceprobability distortion
0
0 comments X

The pith

The Skip mechanism for constrained sports group draws is least distorted when pots are processed in decreasing order of teams from the restricted set S.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies how the Skip mechanism, which draws teams sequentially from pots and skips invalid placements to enforce constraints, produces unequal probabilities for valid group assignments. It focuses on the case where each group may contain at most two teams from a given set S and derives exact probabilities for three-pot problems in which two pots each hold one team from S. Complete enumeration of all small instances with three pots and at most five teams per pot is also performed, together with three real tournaments from basketball and football. The central result is that the sequence of pots that minimizes the deviation from uniformity draws first from the pot containing the largest number of teams from S, then the next largest, and so on.

Core claim

When the Skip mechanism enforces the rule that each group contains at most two teams from set S, the valid assignments are not equally likely. For any number of teams in three-pot settings where exactly two pots contain one team from S, closed-form expressions give the probability of each valid assignment. Enumeration for small problems confirms the same dependence on pot order. In the three examined real tournaments the ordering that processes pots from highest to lowest number of S-teams yields the smallest distortion from the uniform distribution over valid assignments.

What carries the argument

The Skip mechanism: sequential random selection from pots that discards any draw violating the at-most-two-teams-from-S constraint and continues until a valid assignment is obtained.

If this is right

  • Exact probability formulas are available for every three-pot configuration in which two pots each contain exactly one team from S.
  • Complete probability tables exist for all instances with three pots and five or fewer teams per pot.
  • In the three real basketball and football cases examined, the decreasing-S-count order produces measurably lower distortion than the other five orders.
  • Organizers can therefore select, among transparent Skip procedures, the single order that comes closest to uniform selection over valid assignments.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same ordering rule may reduce distortion for constraints other than the two-from-S limit or for more than three pots.
  • For tournaments too large for enumeration, Monte-Carlo sampling of the Skip process could still identify the best order without enumerating every valid assignment.
  • If the non-uniformity remains large even under the best order, organisers might need to replace the Skip mechanism with a fully uniform but less transparent procedure.
  • The quantitative distortion measures supplied here could be used to set a threshold beyond which a tournament switches draw methods.

Load-bearing premise

The model assumes the Skip mechanism is executed as pure random sequential selection with immediate rejection of invalid partial assignments and that the constraint is precisely at most two teams from S per group.

What would settle it

For any concrete three-pot instance with known team counts from S, enumerate all valid final assignments, compute their exact probabilities under each possible pot order, and check whether the order with highest S-count first ever fails to produce the smallest maximum deviation from uniformity.

Figures

Figures reproduced from arXiv: 2109.13785 by L\'aszl\'o Csat\'o.

Figure 1
Figure 1. Figure 1: The average biases of draw procedures for the national teams [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗
read the original abstract

The group draw of a sports tournament requires assigning teams to groups of (almost) the same size. The most important criteria for a draw procedure are balance, randomness, and transparency, which could not be satisfied simultaneously if draw constraints exist. Organisers usually use the so-called Skip mechanism, a method based on a random sequential draw of the teams from pots, in order to ensure balance and transparency. However, the Skip mechanism is non-uniformly distributed: the valid assignments are not necessarily equally likely. We quantify this distortion if a group can contain at most two teams from a given set S, which poses a serious challenge for the Skip mechanism. Our study provides exact results for an arbitrary number of teams when there are three pots and two pots contain only one team from the set S, as well as complete enumeration for small problems with three pots and at most five teams per pot. We also analyse three real-world case studies from basketball and football. It turns out that the optimal design considers the pots in decreasing order according to the number of teams in the set S. These results can be used to identify the least distorted transparent draw procedure, and decide whether the extent of non-uniformity calls for further actions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper analyzes the non-uniformity induced by the Skip mechanism in constrained group draws for sports tournaments, where each group may contain at most two teams from a distinguished set S. It supplies exact closed-form distortion probabilities for the three-pot case in which exactly two pots each contain a single team from S, performs exhaustive enumeration over all valid assignments for instances with at most five teams per pot, applies the framework to three real tournaments (basketball and football), and concludes that ordering the pots in decreasing order of the number of S-teams they contain minimizes the distortion.

Significance. If the probability calculations hold, the work supplies a practical, low-cost design rule that improves uniformity while preserving the transparency of the Skip procedure. The exact closed-form results for the two-singleton-S case and the complete enumerations for small instances constitute verifiable, parameter-free contributions that directly support the ordering recommendation and can be used by tournament organizers to decide whether the residual non-uniformity is acceptable.

major comments (2)
  1. [Case studies and mechanism description] The central ordering claim rests on the distortion probabilities computed under the specific Skip implementation (random sequential draw with invalid assignments skipped). The manuscript should therefore contain an explicit statement, with a small worked example, confirming that this implementation matches the procedure actually used in the three case studies; without it the quantitative comparison between orderings is not fully grounded.
  2. [Exact results and enumeration sections] The abstract asserts that exact results and exhaustive enumerations exist, yet the provided text supplies neither the derivation of the closed-form expressions nor any cross-verification (e.g., comparison of the formula against the enumeration for a small instance). Because these probabilities are load-bearing for the optimality conclusion, the derivations or at least a reproducibility appendix should be included.
minor comments (2)
  1. Notation for the set S and the per-pot counts |S ∩ pot_i| should be introduced once in a dedicated notation paragraph and used consistently thereafter.
  2. [Case studies] The three real-world case studies would benefit from a short table listing, for each ordering, the computed distortion probability and the number of valid assignments, so that the magnitude of the improvement is immediately visible.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive assessment and constructive suggestions for minor revisions. We address each major comment below and will update the manuscript accordingly to strengthen the grounding of our results.

read point-by-point responses

  1. Referee: [Case studies and mechanism description] The central ordering claim rests on the distortion probabilities computed under the specific Skip implementation (random sequential draw with invalid assignments skipped). The manuscript should therefore contain an explicit statement, with a small worked example, confirming that this implementation matches the procedure actually used in the three case studies; without it the quantitative comparison between orderings is not fully grounded.

    Authors: We agree that an explicit link between the computational model and the real-world procedures is required for full transparency. The Skip implementation used for the distortion calculations is the standard random sequential draw that skips invalid assignments, matching the documented procedures in the three case studies. In the revised manuscript we will add a short subsection (or paragraph in the case-studies section) that states this equivalence and supplies a small worked example illustrating the correspondence for one of the tournaments. revision: yes

  2. Referee: [Exact results and enumeration sections] The abstract asserts that exact results and exhaustive enumerations exist, yet the provided text supplies neither the derivation of the closed-form expressions nor any cross-verification (e.g., comparison of the formula against the enumeration for a small instance). Because these probabilities are load-bearing for the optimality conclusion, the derivations or at least a reproducibility appendix should be included.

    Authors: We accept that the main text does not contain the full derivations or explicit cross-verifications, which limits immediate reproducibility. We will add a dedicated reproducibility appendix that (i) derives the closed-form distortion probabilities for the three-pot, two-singleton-S case and (ii) presents side-by-side numerical comparisons of the formulas against exhaustive enumerations for several small instances (e.g., 3–4 teams per pot). This will directly support the optimality claim. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper derives exact closed-form distortion probabilities for the three-pot case with two singleton-S pots and performs exhaustive enumeration for small instances (≤5 teams/pot). These are direct combinatorial calculations from the stated Skip mechanism and 'at most two from S' constraint. The recommendation to order pots by decreasing |S| follows from comparing the computed probabilities across orderings. No self-definitional reductions, fitted inputs renamed as predictions, load-bearing self-citations, or other enumerated circular patterns are present. The central claims rest on independent enumeration and case studies.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the combinatorial definition of valid assignments under the 'at most two from S' constraint and the procedural definition of the Skip mechanism as sequential random draws with skips.

axioms (1)
  • domain assumption The Skip mechanism is a random sequential draw of teams from pots, skipping any assignment that would violate the group constraint.
    This modeling choice is invoked throughout the abstract to define the probability distribution whose non-uniformity is quantified.

pith-pipeline@v0.9.0 · 5743 in / 1244 out tokens · 32722 ms · 2026-05-25T08:26:27.692683+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    and Wilson, A

    Boczo\'n, M. and Wilson, A. J. (2018). Goals, constraints, and public assignment: A field study of the UEFA C hampions L eague. Technical Report 18/016, University of Pittsburgh, Kenneth P. Dietrich School of Arts and Sciences, Department of Economics. https://www.econ.pitt.edu/sites/default/files/working_papers/Working

    work page 2018

  2. [2]

    Cea, S., Dur \'a n, G., Guajardo, M., Saur \'e , D., Siebert, J., and Zamorano, G. (2020). An analytics approach to the FIFA ranking procedure and the W orld C up final draw. Annals of Operations Research , 286(1-2):119--146

    work page 2020

  3. [3]

    Csat\'o, L. (2019). UEFA C hampions L eague entry has not satisfied strategyproofness in three seasons. Journal of Sports Economics , 20(7):975--981

    work page 2019

  4. [4]

    Csat\'o, L. (2021). Tournament Design: How Operations Research Can Improve Sports Rules . Palgrave Pivots in Sports Economics. Palgrave Macmillan, Cham, Switzerland

    work page 2021

  5. [5]

    and Sonin, K

    Dagaev, D. and Sonin, K. (2018). Winning by losing: I ncentive incompatibility in multiple qualifiers. Journal of Sports Economics , 19(8):1122--1146

    work page 2018

  6. [6]

    Depetris-Chauvin, E., Durante, R., and Campante, F. (2020). Building nations through shared experiences: E vidence from A frican football. American Economic Review , 110(5):1572--1602

    work page 2020

  7. [7]

    Dur \'a n, G., Guajardo, M., and Saur \'e , D. (2017). Scheduling the S outh A merican Q ualifiers to the 2018 FIFA W orld C up by integer programming. European Journal of Operational Research , 262(3):1109--1115

    work page 2017

  8. [8]

    FIFA C ouncil confirms contributions for FIFA W orld C up participants

    FIFA (2017). FIFA C ouncil confirms contributions for FIFA W orld C up participants. 27 October. http://web.archive.org/web/20200726200924/https://www.fifa.com/who-we-are/news/fifa-council-confirms-contributions-for-fifa-world-cup-participants-2917806

    work page arXiv 2017

  9. [9]

    Revision of the FIFA / C oca- C ola W orld R anking

    FIFA (2018). Revision of the FIFA / C oca- C ola W orld R anking. https://img.fifa.com/image/upload/edbm045h0udbwkqew35a.pdf

    work page 2018

  10. [10]

    Guyon, J. (2014). Rethinking the FIFA W orld C up TM final draw. Manuscript. DOI : 10.2139/ssrn.2424376 http://dx.doi.org/10.2139/ssrn.2424376

    work page doi:10.2139/ssrn.2424376 2014

  11. [11]

    Guyon, J. (2015). Rethinking the FIFA W orld C up TM final draw. Journal of Quantitative Analysis in Sports , 11(3):169--182

    work page 2015

  12. [12]

    Guyon, J. (2018). What a fairer 24 team UEFA E uro could look like. Journal of Sports Analytics , 4(4):297--317

    work page 2018

  13. [13]

    Jones, M. C. (1990). The W orld C up draw's flaws. The Mathematical Gazette , 74(470):335--338

    work page 1990

  14. [14]

    and Lenten, L

    Kendall, G. and Lenten, L. J. A. (2017). When sports rules go awry. European Journal of Operational Research , 257(2):377--394

    work page 2017

  15. [15]

    and Becker, M

    Kl \"o ner, S. and Becker, M. (2013). Odd odds: The UEFA C hampions L eague R ound of 16 draw. Journal of Quantitative Analysis in Sports , 9(3):249--270

    work page 2013

  16. [16]

    and L \'o pez, F

    Laliena, P. and L \'o pez, F. J. (2019). Fair draws for group rounds in sport tournaments. International Transactions in Operational Research , 26(2):439--457

    work page 2019

  17. [17]

    and Rathgeber, H

    Rathgeber, A. and Rathgeber, H. (2007). Why G ermany was supposed to be drawn in the group of death and why it escaped. Chance , 20(2):22--24

    work page 2007

  18. [18]

    UEFA EURO 2016 qualifying draw procedure

    UEFA (2014). UEFA EURO 2016 qualifying draw procedure. 23 February. https://www.uefa.com/MultimediaFiles/Download/competitions/Draws/02/04/64/31/2046431_DOWNLOAD.pdf

    work page 2014

  19. [19]

    UEFA EURO 2020 qualifying draw

    UEFA (2018a). UEFA EURO 2020 qualifying draw. 2 December. https://www.uefa.com/european-qualifiers/news/newsid=2573388.html

    work page 2020

  20. [20]

    UEFA N ations L eague 2018/19 -- L eague phase draw procedure

    UEFA (2018b). UEFA N ations L eague 2018/19 -- L eague phase draw procedure. https://www.uefa.com/MultimediaFiles/Download/uefaorg/General/02/52/51/09/2525109_DOWNLOAD.pdf

    work page 2018

  21. [21]

    How UEFA prepares for C hampions L eague and E uropa L eague draws

    UEFA (2019). How UEFA prepares for C hampions L eague and E uropa L eague draws. 12 December. https://www.uefa.com/uefaeuropaleague/news/025a-0e9f980ebd9f-5949171cd9e2-1000--how-uefa-prepares-for-champions-league-and-europa-league-draws/

    work page 2019

  22. [22]

    FIFA W orld C up 2022 qualifying draw procedure

    UEFA (2020a). FIFA W orld C up 2022 qualifying draw procedure. https://www.uefa.com/MultimediaFiles/Download/competitions/WorldCup/02/64/22/19/2642219_DOWNLOAD.pdf

    work page 2022

  23. [23]

    UEFA N ations L eague 2020/21 -- league phase draw procedure

    UEFA (2020b). UEFA N ations L eague 2020/21 -- league phase draw procedure. https://www.uefa.com/MultimediaFiles/Download/competitions/General/02/63/57/88/2635788_DOWNLOAD.pdf

    work page 2020

  24. [24]

    Wright, M. (2014). OR analysis of sporting rules -- A survey. European Journal of Operational Research , 232(1):1--8

    work page 2014