A 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 tournaments with at most four vertices are heroes. In this...

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

Prize and Risk-Taking Strategy in Tournaments: Evidence from Professional Poker Players This study examines whether people optimally respond to prize incentives for risk taking in tournaments. I exploit the television game show World Poker Tour as a natural experiment. The results show that professional players strategically choose the degree of risk taking depending on the incentives implied b...

In this note, we provide a sharp upper bound on the rainbow connection number of tournaments of diameter 2. For a tournament T of diameter 2, we show 2 ≤ − →rc(T ) ≤ 3. Furthermore, we provide a general upper bound on the rainbow k-connection number of tournaments as a simple example of the probabilistic method. Finally, we show that an edge-colored tournament of kth diameter 2 has rainbow k-co...

An in-tournament is an oriented graph such that the in-neighborhood of every vertex induces a tournament. Therefore, in-tournaments are a generalization of local tournaments where, for every vertex, the set of inneighbors as well as the set of out-neighbors induce a tournament. While local tournaments have been intensively studied very little is known about in-tournaments. It is the purpose of ...

The objective of this research is to provide a statistical measurement to predict the likely winners of international football tournaments with particular reference to the Euro 2008 football tournament. This research argues that there exists a positive relationship between the competitive balance and success in international football tournaments. The level of the competitive balance in a domest...

We test the implications of ambiguity aversion in a principal-agent problem with multiple agents. When output distributions are uncertain, models of ambiguity aversion suggest that tournaments may become more attractive than independent wage contracts, in contrast to the case where output distributions are known. We do so by presenting agents with a choice between tournaments and independent co...

We characterize the tournaments that are dominance graphs of sets of (unfair) coins in which each coin displays its larger side with greater probability. The class of these tournaments coincides with the class of tournaments whose vertices can be numbered in a way that makes them semiacyclic, as defined by Postnikov and Stanley. We provide an example of a tournament on nine vertices that cannot...

This note uncovers new properties of the von Neumann-Morgenstern solution in weak tournaments and majoritarian games. We propose a new procedure for the construction of choice sets from weak tournaments, based on dynamic stability criteria. The idea is to analyze dynamic versions of the tournament game introduced by Laffond, Laslier and Le Breton (1993) [The bipartisan set of a tournament game....