We study Maker/Breaker games on the edges of the complete graph, as introduced by Chvátal and Erdős. We show that in the (m : b) clique game played on KN , the complete graph on N vertices, Maker can achieve a Kq for q = ( m log 2 (b+1) − o(1) ) · logN , which partially solves an open problem by Beck. Moreover, we show that in the (1:1) clique game played on KN for a sufficiently large N , Make...

We study Maker/Breaker games on the edges of the complete graph, as introduced by Chvátal and Erdős. We show that in the (m : b) game played on KN , the complete graph on N vertices, Maker can achieve a Kq for q = ( m log 2 (b+1) − o(1) ) · log2 N , which partially solves an open problem by Beck. Moreover, we show that in the (1 : 1) game played on KN for a sufficiently large N , Maker can achi...

Recent experimental results indicate that women do not like competitive environments as much as men. This paper presents an experimental design giving participants the opportunity to enter a tournament as part of a team rather than alone. While a large and significant gender gap in entry in the individual tournament is found in line with the literature, no gender gap is found in entry in the te...

A version of the Erdős-Hajnal conjecture for tournaments states that for every tournament H every tournament T that does not contain H as a subtournament, contains a transitive subtournament of size at least n (H) for some (H) > 0, where n is the order of T . For any fixed tournament H we can denote by n0(H) the supremum over all ≥ 0 satisfying the following statement: every tournament T of ord...

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

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