Random Two-sided Matching
   HOME

TheInfoList



OR:

A random two-sided matching is a process by which members of two groups are matched to each other in a random way. It is often used in sports in order to match teams in
knock-out tournament A tournament is a competition involving at least three competitors, all participating in a sport or game. More specifically, the term may be used in either of two overlapping senses: # One or more competitions held at a single venue and concentr ...
s. In this context, it is often called a draw, as it is implemented by drawing balls at random from a bowl, each ball representing the name of a team.


Examples


The UEFA Champions League, UEFA Europa League, and UEFA Conference League draw

A random two-sided matching occurs in the
UEFA Champions League The UEFA Champions League (UCL) is an annual club association football competition organised by the UEFA, Union of European Football Associations (UEFA) that is contested by List of top-division football clubs in UEFA countries, top-divisio ...
Round of 16 and
UEFA Europa League The UEFA Europa League (UEL), usually known simply as the Europa League, is an annual association football, football club competition organised since 1971 by the UEFA, Union of European Football Associations (UEFA) for eligible European footb ...
Round of 32. After some games are done within 8 groups, the group winner and the group runner-up proceed to the champions league. The UEFA rules say that each winner should be paired with a runner-up. Without further constraints, this problem could easily be solved by finding a
random permutation A random permutation is a sequence where any order of its items is equally likely at random, that is, it is a permutation-valued random variable of a set of objects. The use of random permutations is common in games of chance and in randomized alg ...
of the winners. But UEFA rules impose two additional constraints: two teams from the same group cannot be paired, and two teams from the same association cannot be paired. Thus, the goal is to choose a random matching in an incomplete
bipartite graph In the mathematics, mathematical field of graph theory, a bipartite graph (or bigraph) is a Graph (discrete mathematics), graph whose vertex (graph theory), vertices can be divided into two disjoint sets, disjoint and Independent set (graph theo ...
. The UEFA mechanism makes several draws from different bowls. At the beginning, there are: * Bowl 1, containing identical balls each of which represents one group runner-up; * Bowl 2, initially empty, to be filled and refilled later. * Bowls A to H, each of which represents a group winner and contains 7 balls with the winner's name on it. The draw proceeds as follows: * A ball is drawn from bowl 1, and the runner-up's name is displayed; * A computer program shows all winners that can — according to the UEFA rules — be paired with the drawn runner-up. This takes into account not only current constraints, but also constraints for future runners-up. * From some of the bowls A to H, representing the potential winners, a single ball is taken and put in bowl 2; * The balls in bowl 2 are shuffled. One ball is drawn, and it represents the winner matched to the previously drawn runner-up. * Bowl 2 is emptied, and the process repeats for 8 rounds. This procedure yields probabilities that are different than just choosing a matching at random; this creates a distortion in the matching probalities of different groups, which raises suspicion and
conspiracy theories A conspiracy theory is an explanation for an event or situation that asserts the existence of a conspiracy (generally by powerful sinister groups, often political in motivation), when other explanations are more probable.Additional sources: * ...
.


The FIFA draw

Another two-sided matching occurs in the
FIFA World Cup The FIFA World Cup, often called the World Cup, is an international association football competition among the senior List of men's national association football teams, men's national teams of the members of the FIFA, Fédération Internatio ...
. First, the runners-up are drawn in a random order. Then, each winner in turn is drawn, and it is matched to the first runner-up in the order, to which it can be matched according to the constraints. This draw, too, produces distorted probabilities relative to the uniform-random matching.


See also

*
Fair random assignment Fair random assignment (also called probabilistic one-sided matching) is a kind of a fair division problem. In an ''assignment problem'' (also called '' house-allocation problem'' or '' one-sided matching''), there are ''m'' objects and they have t ...
- one-sided matching - allocating items to agents with different preferences.


References

{{reflist Matching (graph theory) Randomness