The organiser of the UEFA Champions League, one of the most prestigious football tournaments in the world, faces a non-trivial mechanism design problem each autumn: how to choose a perfect matching in a balanced bipartite graph randomly. For the sake of credibility and transparency, the Round of 16 draw consists of some discrete uniform choices from two urns whose compositions are dynamically updated with computer assistance. Even though the adopted mechanism is unevenly distributed over all valid assignments, it resembles the fairest possible lottery according to a recent result. We challenge this finding by analysing the effect of reversing the order of the urns. The optimal draw procedure is shown to be primarily dependent on the lexicographic order of degree sequences for the two sets of teams. An example is provided where exchanging the urns can reduce unfairness by one-third on average and almost halve the worst bias for all pairs of teams. Nonetheless, the current policy of starting the draw with the runners-up remains the best option if the draw order should be determined before the national associations of the clubs are known.
翻译:UEFA冠军联赛的组织者每年秋季面临着一个非常棘手的机制设计问题:如何在均衡的二分图中随机选择一个完美的匹配。为了保证可信度和透明度,16强淘汰赛抽签由两个组成动态更新的球队名单进行一些离散均匀的选择,辅以计算机辅助。尽管采用的机制在所有有效的分配中分布不均,但根据最近的一项研究结果,它类似于最公平的彩票。我们通过分析抽签顺序的影响来挑战这一发现。最佳的抽签程序主要取决于两组球队的度数序列的词典顺序。我们提供了一个例子,其中交换球队名单可以平均减少三分之一的不公平,并几乎减半了所有球队成对之间的最差偏差。尽管如此,在国家协会的俱乐部知道之前确定抽签顺序是最好的选择。