Properties of various knockout tournament designs are discussed and theoretical results presented. Potential playoff schemes for Division I-A football are examined via simulation studies. Several metrics, differing in number, selection and seeding of playoff teams, are used to assess the relative merits of playoff scenarios. Most suggest that college football would benefit from a limited playof...

The aim of this experiment was to learn which learning model, feature selection technique, ordering process, and distance criteria provided the best classification accuracy in predicting the outcome of any NCAA Men’s Basketball Tournament match. Ninety-four features were selected from ESPN.com for each team accepted into the tournament for the last four years. Ordering processes were tested aga...

We begin with a cautionary tale. In 2012, the Olympics were held in London. One of the biggest scandals of the event concerned, of all sports, women’s badminton. The scandal did not involve any failed drug tests, but rather a failed tournament design that did not carefully consider incentives. The tournament design that was used is familiar from the World Cup soccer. There are four groups (A,B,...

We define the notions of a free fusion structures and weakly stationary independence relation. apply these to prove simplicity for automorphism groups order tournament expansions homogeneous like bounded Urysohn space, random graph, poset.

Every year, billions of dollars are spent gambling on the outcomes of the NCAA men’s basketball tournament. The current work examines how individuals make predictions for one of the most popular forms of betting, tournament pools, in which individuals must correctly predict as many games in the tournament as possible. We demonstrate that individuals predict more upsets (i.e., wins by a higher-s...

We classify the countably infinite oriented graphs which, for every partition of their vertex set into two parts, induce an isomorphic copy of themselves on at least one of the parts. These graphs are the edgeless graph, the random tournament, the transitive tournaments of order type ωα, and two orientations of the Rado graph: the random oriented graph, and a newly found random acyclic oriented...

A new search method to the feature selection problem – the tournament searching – is proposed and compared with other popular feature selection methods. The tournament feature selection method is a simple stochastic searching method with only one parameter controlling the global-local searching properties of the algorithm. It is less complicated and easier to use than other stochastic methods, ...

background:   h2-eb1 molecule which is the homolog of human hla-drb1 is proposed to be associated with allergic rhinitis (ar). construction of   h2-eb1 knockout animal models provides a tool to elucidate the role of h2-eb1 and ar pathogenesis. objective:   to establish the h2-eb1 knockout model and investigate the h2-eb1 functions in   h2-eb1 knockout mice as a model of ar. methods: the cre/lox...

Statistics of soccer tournament scores based on the double round robin system of several countries are studied. Exploring the dynamics of team scoring during tournament seasons from recent years we find evidences of superdiffusion. A mean-field analysis results in a drift velocity equal to that of real data but in a different diffusion coefficient. Along with the analysis of real data we presen...