Sumner’s universal tournament conjecture states that any tournament on 2n−2 vertices contains a copy of any directed tree on n vertices. We prove an asymptotic version of this conjecture, namely that any tournament on (2 + o(1))n vertices contains a copy of any directed tree on n vertices. In addition, we prove an asymptotically best possible result for trees of bounded degree, namely that for ...

This paper compares the effectiveness of n-way (n > 2) classification using a probabilistic classifier to the use of multiple binary probabilistic classifiers. We describe the use of binary classifiers in both Round Robin and Elimination tournaments, and compare both tournament methods and n-way classification when determining the language of origin of speakers (both native and non-native Engli...

Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...

© 1992 by Cornell University 0001-8392/92/3702-0336/$1.00. Tournament models have developed into an important component of the theoretical literature on organizational reward systems. However, with one exception there have been no empirical tests of the incentive effects of tournament models in a field setting. Drawing on a panel data set from auto racing, we show that the tournament spread (pr...

A strategic (round-robin) tournament is a simultaneous n-player game built on top of a symmetric two-player game G. Each player chooses one action in G and is matched to play G against all other players. The winner of the tournament is the player who achieves the highest total G-payoff. The tournament has several interpretations as an evolutionary model, as a model of social interaction, and as...

We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an n-vertex tournament. We prove that every tournament on n vertices has at most 1.6740 minimal feedback vertex sets and that there is an infinite family of tournamen...

It is well known that every tournament contains a Hamiltonian path, which can be restated as that every tournament contains a unary spanning tree. The purpose of this article is to study the general problem of whether a tournament contains a k-ary spanning tree. In particular, we prove that, for any fixed positive integer k, there exists a minimum number h(k) such that every tournament of order...

The standard tournament selection samples individuals with replacement. The sampling-with-replacement strategy has its advantages but also has issues. One of the commonly recognised issues is that it is possible to have some individuals not sampled at all during the selection phase. The not-sampled issue aggravates the loss of diversity. However, it is not clear how the issue affects GP search....

This note uncovers new properties of the von Neumann-Morgenstern solution in weak tournaments and majoritarian games. We propose a new procedure for the construction of choice sets from weak tournaments, based on dynamic stability criteria. The idea is to analyze dynamic versions of the tournament game introduced by Laffond, Laslier and Le Breton (1993) [The bipartisan set of a tournament game....