Procedures designed to select alternatives on the basis of the results of pairwise contests between them have received much attention in literature. The particular case of tournaments has been studied in depth. More recently weak tournaments and valued generalizations thereof have been investigated. The purpose of this paper is to investigate to what extent these choice procedures may be meanin...

We study a principal-agent problem with multiple identical agents, where the action-dependent stochastic relationship between actions and output is perceived to be ambiguous, and agents are ambiguity averse. We argue that ambiguity, and particularly ambiguity aversion, make it more attractive for the principal to choose a tournament. If agents are risk neutral, but ambiguity averse, we show tha...

We provide a detailed study of topological and combinatorial properties sectionable tournaments. This class forms an inductively constructed family tournaments grounded over simply disconnected tournaments, those whose fundamental groups acyclic complexes are non-trivial. When T is tournament, we fully describe the cell-structure its complex Acy(T) by using adapted machinery discrete Morse theo...

The purpose of this study was to describe the application and improvement learning outcomes using Problem Based Learning model with Games Tournaments in improving Indonesian for new vocabulary material class II students at SDN Junrejo 2 Batu. This type research is classroom action research. uses a data collection by means observation also quantitative analysis techniques, namely describing resu...

A tournament T is an orientation of a complete graph, and a feedback vertex set of T is a subset of vertices intersecting every directed cycle of T . We prove that every tournament on n vertices has at most 1.6740 minimal feedback vertex sets and some tournaments have 1.5448 minimal feedback vertex sets. This improves a result by Moon (1971) who showed upper and lower bounds of 1.7170 and 1.475...

We determine two types of generalized exponent sets for tournaments with given order. In the course of proving the main results we find the following result, which may be interesting in its own right: When n is large enough, almost all tournaments on n vertices have the property that there is a path of length 2 from each vertex u to each vertex v 6= u.