M hierarchical organizations, like corporations, must motivate agents to work hard. Given their pyramid structure, it is not surprising that one commonly used motivator is the promotion tournament. In such tournaments, agents compete to advance to positions at higher organizational levels. Though these tournaments are common, little research has empirically looked at the interface of organizati...

A digraph D is a local out-tournament if the outset of every vertex: is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices. Of specific interest is the out-tournament whose adjacency matrix has boolean, nonnegative integer, term, and real rank all equal to the number of vertices, n. Corres...

The set S of distinct scores (outdegrees) of the vertices of a k-partite tournament T(X1, X2, · · · , X k) is called its score set. In this paper, we prove that every set of n non-negative integers, except {0} and {0, 1}, is a score set of some 3-partite tournament. We also prove that every set of n non-negative integers is a score set of some k-partite tournament for every n ≥ k ≥ 2.

The accuracy-based fitness approach in XCS is one of the most significant changes in comparison with original learning classifier systems. Nonetheless, neither the scaled accuracy function, nor the importance of the relative fitness approach has been investigated in detail. The recent introduction of tournament selection to XCS has shown to make the system more independent from parameter settin...

—The mortality of fish captured in fishing tournaments has commonly been estimated incorrectly and, thus far, only one account has presented an estimate of the standard error or confidence interval for tournament-associated mortality. In this article we describe methods for estimating the initial, delayed, and total mortality of tournament-caught fish and provide formulae for estimating the sam...

This paper provides an analysis of a natural k-round tournament over n = 2' players, and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is exploited by using it as a building block for efficient parallel sorting algorithms under a variety of different models of computation. Three important applications are provided. Fir...

An orientation of a complete graph is a tournament, and an orientation of a complete n-partite graph is an n-partite tournament. For each n 2:: 4, there exist examples of strongly connected n-partite tournament without any strongly connected subtournaments of order p 2:: 4. If D is a digraph, then let d+ (x) be the out degree and d(x) the indegree of the vertex x in D. The minimum (maximum) out...

Competitive high ranking positions are largely occupied by men, and women remain scarce in engineering and sciences. Explanations for these occupational differences focus on discrimination and preferences for work hours and field of study. We explore an additional explanation, namely that women and men may differ in their selection into competitive environments. Men and women in a laboratory ex...

The purpose of this study was to: a) identify changes in jump height and perceived well-being as indirect markers of fatigue, b) determine the internal and external workloads performed by players, and c) examine the influence of Yo-Yo IR2 on changes in jump height, perceived well-being and internal and external workloads during a tag football tournament. Microtechnology devices combined with he...