The idea that Operational Research can be used to optimise the design of a sporting contest or tournament is a novel one. This paper considers a methodology for this purpose. We propose a number of tournament metrics that can be used to measure the success of a sporting contest or tournament, and describe how these metrics may be evaluated for a particular tournament design. Knowledge of these ...

We consider (ǫ, δ)-PAC maximum-selection and ranking for general probabilistic models whose comparisons probabilities satisfy strong stochastic transitivity and stochastic triangle inequality. Modifying the popular knockout tournament, we propose a maximum-selection algorithm that uses O (

A multi-player connict is modelled as a knockout tournament. In a contest between two individuals who use behaviours x and y there is a probability that each will win and a cost incurred by the loser; both of which depends on x and y. Groups of individuals resolve their disputes in the form of a knockout tournament in which in each round the remaining contestants form pairs who contest, with wi...

The Random Forest algorithm is an ensemble technique that can achieve high accuracy on classification and regression with minimal tuning of parameters. This paper analyzes the effectiveness of the Random Forest classification algorithm under decreasing randomness in the bootstrap sampling procedure, in increasing tournament size, and in tournament participant selection.

Tournament solutions provide methods for selecting the best alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out any alternative in large random tournaments. Nevertheless, all analytical results thus far have assumed a rigid probabilistic model, in which either a tournament...

A knockout (or single-elimination) tournament is a format of competition that very popular in practice (particularly sports, elections and decision making), which has been extensively intensively studied from theoretical point view for more than decade. Particular attention devoted to the Tournament Fixing problem, where, roughly speaking, objective determine whether we can conduct way makes ou...

We study the Maker-Breaker tournament game played on the edge set of a given graph G. Two players, Maker and Breaker, claim unclaimed edges of G in turns, while Maker additionally assigns orientations to the edges that she claims. If by the end of the game Maker claims all the edges of a pre-defined goal tournament, she wins the game. Given a tournament Tk on k vertices, we determine the thresh...

This paper reports an experimental study of two stochastic audit schemes for enforcing regulatory compliance. In the Random Audit mechanism firms are randomly chosen for inspection. In the Tournament Audit mechanism the probability of inspection increases with the degree of estimated under-reporting. The experiment also varies the observability of identity, output, and compliance decisions. Opt...