Abstract This paper collects a unique data set of classified ads and exploits quasi-random variation in the applicant pool composition to show that there exists hiring discrimination against immigrants South Africa’s informal sector. Consistent with tournament models which are penalised, I find both immigrant native job seekers receive more employer clicks on their profile when being pooled app...

We give a short constructive proof of a theorem of Fisher: every tournament contains a vertex whose second outneighbourhood is as large as its first outneighbourhood. Moreover, we exhibit two such vertices provided that the tournament has no dominated vertex. The proof makes use of median orders. A second application of median orders is that every tournament of order 2n − 2 contains every arbor...

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.