Abstract. A tournament matrix and its corresponding directed graph both arise as a record of the outcomes of a round robin competition. An n × n complex matrix A is called h-pseudo-tournament if there exists a complex or real nonzero column vector h such that A+ A∗ = hh∗ − I . This class of matrices is a generalisation of well-studied tournament-like matrices such as h-hypertournament matrices,...

Individual willingness to enter competitive environments predicts career choices and labor market outcomes. Meanwhile, many people experience competitive contexts as stressful. We use two laboratory experiments to investigate whether factors related to stress can help explain individual differences in tournament entry. Experiment 1 studies whether stress responses (measured as salivary cortisol...

We propose to deploy the tournament methods to perform the task of email categorization. The multi-class categorization process is thus broken down into a set of binary classification tasks. We implement the elimination tournament and Round Robin tournament and apply them to classify emails within 15 folders. We conduct substantial experiments to compare the effectiveness and robustness of the ...

1. Introduction Pollard and Reep (1997) point out that " soccer coaches, players, fans, and the media are deeply skeptical and often suspicious, to the point of paranoia, at the suggestion that a statistician might have something useful to offer […] ". Statisticians, though, have a different opinion. Statistical interest on the aspects of the game has been steadily rising over the past decades....

The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements. Here a characteristic subset is a set that when containing an element contains all elements that have the same probability. With this technique at hand the paper looks at the special case of the tournament isomorphism problem that stands in the way towards a...

In this thesis, we investigate several properties of k-tournaments, where k 2 3. These properties fall into three broad areas. The first contains properties related to the ranking of the participants in a k-tournament, including a representation theorem for posets. The second contains properties related to the representation of a finite group as the automorphism group of a k-tournament, with va...

It is shown that the stochastic dynamics of nongenerational evolutionary algorithms with binary tournament selection and gene pool recombination but without mutation is closely approximated by a stochastic process consisting of several de-coupled random walks, provided the fitness function is separable in a certain sense. This approach leads to a lower bound on the population size such that the...

2. (Iran Team Selection Test 2008/6) Suppose 799 teams participate in a tournament in which every pair of teams plays against each other exactly once. Prove that there exist two disjoint groups A and B of 7 teams each such that every team from A defeated every team from B. Solution: SampleA as a random 7-set. LetX be the number of guys that are totally dominated byA. Letting dv denote the in-de...

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