This paper provides an overview of the research activities that have already been undertaken regarding the development and implementation of the idea of the Turing Tournament. This is a two-sided Tournament designed to encourage improvement of the existing as well as creation of new models of human behavior, emulators, that will be capable of replicating the main features that characterize beha...

Recent results in experimental and personnel economics indicate that women do not like competitive environments as much as men. This article presents an experimental design which gives 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 gend...

In an ordinary (round-robin) tournament there are n people, Pi, , Pn, each of whom plays one game against each of the other n — 1 people. No game is permitted to end in a tie, and the score of Pi is the total number Si of games won by pim By the score sequence of a given tournament is meant the set S = (slf •••,«»), where it may be assumed, with no loss of generality, that sx ^ ^ sn. Landau [3]...

In the context of principal-agent theory risk is largely seen as a source that causes ine¢ ciencies and lowers incentives and accordingly is not in the principal’s interest. In this paper I compare two di¤erent designs of a collective tournament where output in a team is generated through a particular two-stage production process. I show within a theoretical tournament framework that risk in te...

Recent results in experimental and personnel economics indicate that women do not like competitive environments as much as men. This article presents an experimental design which gives 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 gend...

Chen et al. [Partitioning vertices of a tournament into independent cycles, J. Combin. Theory Ser. B 83 (2001) 213–220] proved that every k-connected tournament with at least 8k vertices admits k vertex-disjoint cycles spanning the vertex set, which answered a question posed by Bollobas. In this paper, we prove, as a consequence of a more general result, that every k-connected tournament of dia...

We study the asymptotic behavior of maximum number directed cycles a given length in tournament: let c(ℓ) be limit ratio ℓ an n-vertex tournament and expected random tournament, when n tends to infinity. It is well-known that c(3)=1 c(4)=4/3. show c(ℓ)=1 if only not divisible by four, which settles conjecture Bartley Day. If we 1+2⋅(2/π)ℓ≤c(ℓ)≤1+(2/π+o(1))ℓ determine value exactly for ℓ=8. also...

We say a digraph G is a minor of a digraph H if G can be obtained from a subdigraph of H by repeatedly contracting a strongly-connected subdigraph to a vertex. Here, we show the class of all tournaments is a well-quasi-order under minor containment.

This paper analyzes what structural features of graph problems allow efficient parallel algorithms. We survey some parallel algorithms for typical problems on three kinds of graphs, outerplanar graphs, trapezoid graphs and in-tournament graphs. Our results on the shortest path problem, the longest path problem and the maximum flow problem on outerplanar graphs, the minimum-weight connected domi...

We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization problem are equivalent when the distance between every pair of teams is equal to 1. We show how to construct schedules with a maximum number of breaks for some tournament types. The connection between breaks maximizati...