A tournament T is a pair (A,≻), whereA is a set of alternatives and ≻ is an asymmetric and complete (and thus irreflexive) binary relation on A, usually referred to as the dominance relation. The dominance relation can be extended to sets of alternatives by writing X ≻ Y when x ≻ y for all x ∈ X and y ∈ Y . For a tournament (A,≻), an alternative x ∈ A, and a subset X ⊆ A of alternatives, we den...

UNLABELLED Competition-specific conditioning for tournament basketball games is challenging, as the demands of tournament formats are not well characterized. PURPOSE To compare the physical, physiological, and tactical demands of seasonal and tournament basketball competition and determine the pattern of changes within an international tournament. METHODS Eight elite junior male basketball ...

The tournament text classification methods are proposed in this article to perform the task of email categorization, in which the essence is to break down the multi-class categorization process into a set of binary classification tasks. We implement the methods of elimination and Round Robin tournament to classify emails within 15 folders. Substantial experiments are conducted to compare the ef...

We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks Tournament Canonization algorithm, we give an n n) algorithm for canonization and isomorphism testing of k-hypertournaments, where n is the number of vertices and k is the size of hyperedges.

This article will generally follow the notation and terminology defined in [1]. A digraph is called strongly connected or strong if for every pari of vertices u and v there exists a directed path from u to v and a directed path from v to u. Let k be a positive integer. A digraph G is k-connected if the removal of any set of fewer than k vertices results in a strong digraph. A tournament with n ...

First, some definitions. A tournament is regular of degree k if each point has indegree k and outdegree k: clearly such a tournament has 2k +1 points. The trivial tournament has just one point. A tournament T is doubly regular with subdegree t if it is non-trivial and any two points of T jointly dominate precisely t points; equivalently if T is non-trivial and for each point v of T, the subtour...

This paper deals with the traveling tournament problem, which is a well-known benchmark problem in the field of tournament timetabling. We propose a new lower bound for the traveling tournament problem, and construct a randomized approximation algorithm yielding a feasible solution whose approximation ratio is less than 2+(9/4)/(n−1), where n is the number of teams. For the traveling tournament...

The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We prove that each tournament kernel and each tournament limit can be decomposed into a direct sum of irreducible components, with transitive components interl...

Define the predictability number α(G) of a tournament T to be the largest supermajority threshhold 1 2 < α ≤ 1 for which T could represent the pairwise voting outcomes from some population of voter preference orders. We establish that the predictability number always exists and is rational. Only acyclic tournaments have predictability 1; the Condorcet voting paradox tournament has predictabilit...

We study the power of a tournament organizer in manipulating the outcome of a balanced single-elimination tournament by fixing the initial seeding. This problem is known as agenda control for balanced voting trees. It is not known whether there is a polynomial time algorithm that computes a seeding for which a given player can win the tournament, even if the match outcomes for all pairwise play...