In our paper, we analyze the interplay of contestant heterogeneity and idiosyncratic risk in rank-order tournaments: While in symmetric tournaments an increase in idiosyncratic risk reduces incentives, in asymmetric tournaments this is not necessarily the case: Rather, we show that increasing the level of idiosyncratic risk in asymmetric tournaments will at first increase and—only after a criti...

We investigate tournaments that are projective in the variety that they generate, and free algebras over partial tournaments in that variety. We prove that the variety determined by three-variable equations of tournaments is not locally finite. We also construct infinitely many finite, pairwise incomparable simple tournaments.

Potential, Prizes and Performance: Testing Tournament Theory with Professional Tennis Data This paper tests two hypotheses from the theory of elimination tournaments: (i) that uneven tournaments, where the contestants are ex ante heterogeneous, entail lower effort exertion; this is a prediction from agency theory that has not been tested empirically before; and (ii) whether incentives set throu...

In practice, two types of tournaments can be distinguished − U-type and J-type tournaments. In U-type tournaments, workers receive prizes that have been fixed in advance. In J-type tournaments, the employer fixes an aggregate wage bill in advance, which is then shared among the workers according to their relative performance. The results of the paper show that the outcomes of the two tournament...

A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized arc-pancyclic and strongly path-panconnected local tournaments, respectively. Our results generalize those due to Bu and Zhang (1996) about arc-pancyclic local tournaments and about strongly arc-pancycl...

In this paper, we construct infinite families of tight regular tournaments. In particular, we prove that two classes of regular tournaments, tame molds and ample tournaments are tight. We exhibit an infinite family of 3-dichromatic tight tournaments. With this family we positively answer to one case of a conjecture posed by V. Neumann-Lara. Finally, we show that any tournament with a tight mold...

An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Proc. London Math. Soc. 21 (1970) 716-730, obtained a characterization of strongly connected tournaments with exactly one Hamilton cycle (i.e., n-cycle). For n ≥, we characterize strongly connected n-partite tournaments ...

We investigate tournaments with a specified score vector having additional structure: loopy tournaments in which loops are allowed, Hankel tournaments which are tournaments symmetric about the Hankel diagonal (the anti-diagonal), and combinatorially skew-Hankel tournaments which are skew-symmetric about the Hankel diagonal. In each case, we obtain necessary and sufficient conditions for existen...

In this paper, a new construction for Z-cyclic whist tournaments is given. The known existence results for both Z-cyclic whist tournaments and Z-cyclic triplewhist tournaments are extended. ? 2003 Elsevier B.V. All rights reserved.

A tournament Tis called homogeneous just in case every isomorphism of subtournaments of smaller cardinality can be lifted to an automorphism of T. It is shown that there are precisely three homogeneous tournaments of power N(). Some analogous results for 2-tournaments are obtained. In this paper we characterize countable tournaments which are homogeneous in the sense of Fraissé [1]. As far as w...