1983
DOI: 10.1111/j.2517-6161.1983.tb01223.x
|View full text |Cite
|
Sign up to set email alerts
|

Definitions and Properties for M-Concurrence Designs

Abstract: Summary Incomplete block designs can be regarded as being in some sense approximately partially balanced. In this paper, we show that parameters pjki corresponding to those used for partially balanced designs can be defined for certain designs with m distinct concurrences. These parameters have properties analogous to those for m associate‐class partially balanced incomplete block (PBIB(m)) designs and have proved useful in searching for optimal designs. This leads to a new upper bound for the efficiency facto… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

1984
1984
2014
2014

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(10 citation statements)
references
References 31 publications
0
10
0
Order By: Relevance
“…The regular graph for the design in Table 12. some of the specific results in his paper are incorrect. Jarrett [24] used the term sconcurrence design for Pearce's PBIBD and clarified the situation somewhat. However, he insisted that θ i = θ j unless i = j.…”
Section: Approximations To Balance * In Terms Of Concurrencementioning
confidence: 99%
“…The regular graph for the design in Table 12. some of the specific results in his paper are incorrect. Jarrett [24] used the term sconcurrence design for Pearce's PBIBD and clarified the situation somewhat. However, he insisted that θ i = θ j unless i = j.…”
Section: Approximations To Balance * In Terms Of Concurrencementioning
confidence: 99%
“…where k is the block size, b is the number of blocks, k' = k mod v and r' = r mod b. A tighter bound for Ehas been developed by Jarrett (1983) for two-concurrence designs, i.e. designs in which pairs of treatment labels occur together in either Al or A z blocks, where~I and~2 are non-negative integers.…”
Section: An Upper Bound For Average Efficiency Factorsmentioning
confidence: 99%
“…The treatment concurrence graph has been helpful in constructing good incompleteblock designs for unstructured sets of treatments (Paterson and Patterson, 1984;Jarrett, 1983). The extra complication here is the multiplier CX.…”
Section: General Ideasmentioning
confidence: 99%