We explore the behavior of losers of promotion tournaments after the tournament is concluded. We do so through the use of an experiment in which we vary the design of the promotion tournament to determine how tournament design affects post tournament effort. We provide a theoretical model demonstrating two possible effects from the tournaments which are strategic sabotage and the possibility th...

A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices. An arc is pancyclic in a digraph D, if it belongs to a cycle of length l, for all 3 <= l <= |V (D)|. Let p(D) denote the number of pancyclic arcs in a digraph D and let h(D) denote the maximum number of pancyclic arcs belonging to the same Hamilton cycle of D. Note that p(D) >= h(D). Moon showed...

We study the power of a tournament organizer in manipulating the outcome of a single elimination tournament by fixing the initial seeding. It is not known whether the organizer can efficiently fix the outcome of the tournament even if the match outcomes are known in advance. We generalize a result from prior work by giving a new condition such that the organizer can efficiently find a tournamen...

Tournament outcome uncertainty depends on: the design of the tournament; and the relative strengths of the competitors – the competitive balance. A tournament design comprises the arrangement of the individual matches, which we call the tournament structure, the seeding policy and the progression rules. In this paper, we investigate the effect of seeding policy for various tournament structures...

We study the tournament fixing problem (TFP), which asks whether a tournament organizer can rig a single-elimination (SE) tournament such that their favorite player wins, simply by adjusting the initial seeding. Prior results give two perspectives of TFP: on the one hand, deciding whether an arbitrary player can win any SE tournament is known to be NP-complete; on the other hand, there are a nu...

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

When can one see from the spectrum of a graph whether it is distance-regular or not? We give some new results for when this is the case. As a consequence we find (among others) that the following distance-regular graphs are uniquely determined by their spectrum: The collinearity graphs of the generalized octagons of order (2, 1), (3, 1) and (4, 1), the Biggs-Smith graph, the M22 graph, and the ...