Given a tournament with an acyclic tournament as a feedback arc set we give necessary and sufficient conditions for this feedback arc set to have minimum size.

We find bounds for the domination number of a tournament and investigate the sharpness of these bounds. We also find the domination number of a random tournament.

This paper analyzes the performance of a genetic algorithm that utilizes tournament selection, one-point crossover, and a reordering operator. A model is proposed to describe the combined effect of the reordering operator and tournament selection, and the numerical solutions are presented as well. Pairwise, s-ary, and probabilistic tournament selection are all included in the proposed model. It...

We describe the participation of our program to the 2007 General Game Playing Tournament. It finished at the third place of the qualifying tournament. After an informal description of General Game Playing and of its Game Description Language, we present in details the structure of our player as it participated to the qualifying phase of the tournament. We then present the context of this phase ...

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...

The placement of teams, or players, into a tournament’s brackets can have a significant impact on who will emerge as the champion. At Wimbledon, 32 players are seeded among the 128 singles entrants in that particular tennis tournament. UEFA coefficients are used to select those European soccer clubs that will compete for the Champions League and Europa League titles in the following season. Tea...