نتایج جستجو برای: doubly regular tournament
تعداد نتایج: 137080 فیلتر نتایج به سال:
This article will generally follow the notation and terminology defined in [1]. A digraph is called strongly connected or strong if for every pari of vertices u and v there exists a directed path from u to v and a directed path from v to u. Let k be a positive integer. A digraph G is k-connected if the removal of any set of fewer than k vertices results in a strong digraph. A tournament with n ...
This paper deals with the traveling tournament problem, which is a well-known benchmark problem in the field of tournament timetabling. We propose a new lower bound for the traveling tournament problem, and construct a randomized approximation algorithm yielding a feasible solution whose approximation ratio is less than 2+(9/4)/(n−1), where n is the number of teams. For the traveling tournament...
The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We prove that each tournament kernel and each tournament limit can be decomposed into a direct sum of irreducible components, with transitive components interl...
Define the predictability number α(G) of a tournament T to be the largest supermajority threshhold 1 2 < α ≤ 1 for which T could represent the pairwise voting outcomes from some population of voter preference orders. We establish that the predictability number always exists and is rational. Only acyclic tournaments have predictability 1; the Condorcet voting paradox tournament has predictabilit...
We study the power of a tournament organizer in manipulating the outcome of a balanced single-elimination tournament by fixing the initial seeding. This problem is known as agenda control for balanced voting trees. It is not known whether there is a polynomial time algorithm that computes a seeding for which a given player can win the tournament, even if the match outcomes for all pairwise play...
For two integers n ≥ 3 and 2 ≤ p ≤ n, we denote D(n, p) the digraph obtained from a directed n-cycle by changing the orientations of p − 1 consecutive arcs. In this paper, we show that a family of k-regular (k ≥ 3) bipartite tournament BT4k contains D(4k, p) for all 2 ≤ p ≤ 4k unless BT4k is isomorphic to a digraph D such that (1, 2, 3, ..., 4k, 1) is a Hamilton cycle and (4m+ i− 1, i) ∈ A(D) a...
Abstract. A quantile regression variant of the classical paired comparison model of mean ratings is proposed. The model is estimated using data for the regular 200405 U.S. college basketball season, and evaluated based on predictive performance for the 2005 NCAA basketball tournament. Rather than basing predictions entirely on conditional mean estimates produced by classical least-squares paire...
We present preliminary results from Fermilab E791 on D 0 ? D 0 mixing and doubly Cabibbo-suppressed decays (DCSD) of the D 0 and D + mesons. The time dependence of the wrong-sign signal (D 0 ! K + ?) is used to establish separate limits on DCSD and mixing. From one third of our data we obtained r mix < 0:47%, r DCSD < 2:7% at the 90% conndence level.
We introduce the Tournament Rank Probability Score (TRPS) as a measure to evaluate and compare pre-tournament predictions, where predictions of full tournament results are required be available before begins. The TRPS handles partial ranking teams, gives credit that only slightly wrong, can modified with weights stress importance particular features prediction. Thus, Prediction is more flexible...
In this paper, we begin a classification of the vertex-transitive tournaments of order pq where p and q are distinct odd primes. In particular we characterize the pq-circulant tournaments; see Theorem 4.3. Moreover, we determine 2-closed (in Wielandt’s sense) oddorder transitive permutation groups of degree p and pq by using the classifications of vertextransitive tournaments of order p and pq....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید