1965
DOI: 10.6028/jres.069b.033
|View full text |Cite
|
Sign up to set email alerts
|

The bridge tournament problem and calibration designs for comparing pairs of objects

Abstract: The c lassical tournam e nt problem caiJ s for arranging v individuals int o tea ms o f /) p layers so that a pla yer is teamed th e sa m e number of times with each of th e other pla ye rs and a lso that eac h player is pitted eq ually often aga in st each of th e other players. The play of th e tuurn a m en t resu lt s in th e determination of difference in p e rformance of th e various pairings of th e g roups. In th e s pecial case when p = 2 each team co n s ist s of two players and th e d es igri s are c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

1967
1967
2020
2020

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(11 citation statements)
references
References 5 publications
0
11
0
Order By: Relevance
“…nonabelian). For a subset S of a group G, let S it) = {g~ : g E S} for any integer t. PDSs were named by Chakravarti [8] but they were introduced by Bose and Cameron [9] in their studies of calibration designs and the bridge tournament problem. Although a systematic study of PDSs was started by Ma [10], [11] as a generalization of difference sets, there were a lot of earlier results written in terms of strongly regular graphs or related topics, e.g., Delsarte [12]- [14], Camion [15], Bridges and Mena [16]- [17] and Calderbank and Kantor [18].…”
Section: Strongly Regular Graphs and Partial Difference Setsmentioning
confidence: 99%
“…nonabelian). For a subset S of a group G, let S it) = {g~ : g E S} for any integer t. PDSs were named by Chakravarti [8] but they were introduced by Bose and Cameron [9] in their studies of calibration designs and the bridge tournament problem. Although a systematic study of PDSs was started by Ma [10], [11] as a generalization of difference sets, there were a lot of earlier results written in terms of strongly regular graphs or related topics, e.g., Delsarte [12]- [14], Camion [15], Bridges and Mena [16]- [17] and Calderbank and Kantor [18].…”
Section: Strongly Regular Graphs and Partial Difference Setsmentioning
confidence: 99%
“…Bose and Cameron [11] in 1965 and Baker [8] in 1975 independently established the existence of ZCPS‐Wh(p) for any prime p10.3em(mod0.3em4). Zhang and Chang [41] in 2009 presented the same result for PS(p).…”
Section: Interplay With Various Designsmentioning
confidence: 94%
“…A direct check on the limiting mean of the measurement (2) and use the method of Lagrangian multipliers (with multipliers 2A.) to minimize the function *In all cases treated here a single restraint is sufficient.…”
Section: Need For a Check Standardmentioning
confidence: 99%