Results 31 to 40 of about 68,433 (283)
Local tournaments and in-tournaments
A digraph without loops, multiple arcs and cycles of length two is called a local tournament if the set of in-neighbors as well as the set of out-neighbors of every vertex induces a tournament. In claiming adjacency only for vertices that have a common out-neighbor, this class can be further generalized to the class of in-tournaments.
openaire +4 more sources
The authors derive various results on multipartite tournaments \(T\) concerning (a) the lengths of cycles in \(T\) and (b) the distances from a vertex of maximum score in a given partite set to other vertices within the same partite set.
Wayne Goddard +3 more
openaire +3 more sources
Taxation and Tournaments [PDF]
This paper analyzes the effects of progressive taxes on labour supply and income distribution in the context of the rank-order tournament model originally developed by Lazear and Rosen (1981).
Persson, Mats, Sandmo, Agnar
openaire +4 more sources
Evaluating one-shot tournament predictions
We introduce the Tournament Rank Probability Score (TRPS) as a measure to evaluate and compare pre-tournament predictions, where predictions of the full tournament results are required to be available before the tournament begins.
Claus Thorn Ekstrøm +3 more
doaj +1 more source
AbstractA tournament is a complete graph with its edges directed, and colouring a tournament means partitioning its vertex set into transitive subtournaments. For some tournaments H there exists c such that every tournament not containing H as a subtournament has chromatic number at most c (we call such a tournament H a hero); for instance, all ...
Eli Berger +7 more
openaire +5 more sources
This chapter considers tournaments and hunting as aspects of early modern court culture. It briefly sets out the cultural context of both quasi-martial sports among elite men (and women) as ways of expressing status and looks at their importance for the princes who hosted them.
openaire +1 more source
Abstract We introduce a concept of emotions that emerge when agents compare their own performance with the performances of other agents. Assuming heterogeneity among the agents the interplay of emotions and incentives is analyzed within the framework of rank-order tournaments, which are frequently used in practice.
openaire +3 more sources
Embedding tournaments in simple tournaments
AbstractA tournament is simple if the corresponding relational system is simple in the algebraic sense. It is shown that any tournament Tn with n nodes can be embedded in a simple tournament Tn+1 apart from two exceptional types of tournaments which can be embedded in a simple tournament Tn+2.
openaire +1 more source
Can the FIFA world cup football (soccer) tournament be associated with an increase in domestic abuse? [PDF]
This study aims to establish whether empirical evidence exists to support the anecdotal view that the FIFA world cup football (soccer) tournament can be associated with a rise in reported domestic abuse incidents, when viewed remotely via television ...
O'Flahery, Rosalie +2 more
core +4 more sources
Even tournaments and Hadamard tournaments
An Hadamard tournament is a \(v\times v\) skew-symmetric \((0, 1)\) matrix \(A\) with zero in the diagonals such that the inner product of distinct rows is \(\lambda\) and the inner product of each row with itself is \(2\lambda+ 1\), where \(\nu= 4\lambda+ 3\). The tournament is an even tournament if \(\lambda\) is even.
openaire +2 more sources

