Estimating the Mean with Known Coefficient of Variation

Searls in 1964 showed that when the coefficient of variation is known, the sample mean is dominated with respect to mean squared error by an improved estimator that makes use of that coefficient. In this article we illustrate that this is true for a general class of estimators. Expressions for the minimum mean squared error and the relative efficiency are given for general distributions. The improvement, as measured by relative efficiency, is seen to be independent of the form of the distribution.     

Optimal treatment allocation and study duration for trials with discrete-time survival endpoints

Studies on event occurrence may be conducted in experiments, where one or more treatment groups are compared to a control group. Most of the randomized trials are designed with equally sized groups, but this design is not always the best one. The statistical power of the study may be larger with unequal sample sizes, and researchers may want to place more participants in one group relative to the other due to resource constraints or costs. The optimal designs for discrete-time survival endpoints in trials with two groups, where different proportions of subjects in the experimental group are taken into account, can be studied using the generalized linear model. Applying a cost function, the optimal combination of the number of subjects and periods in the study and the optimal allocation ratio can be found. It is observed that the ratio of the recruitment costs in both groups, the ratio of the recruitment cost in the control group to the cost of obtaining a measurement, the size of the treatment effect, and the shape of the survival distribution have the greatest influence on the optimal design.     

Asymptotically Optimal Design Points for Rejection Algorithms

ABSTRACT

Very fast automatic rejection algorithms were developed recently which allow us to generate random variates from large classes of unimodal distributions. They require the choice of several design points which decompose the domain of the distribution into small sub-intervals. The optimal choice of these points is an important but unsolved problem. Therefore, we present an approach that allows us to characterize optimal design points in the asymptotic case (when their number tends to infinity) under mild regularity conditions. We describe a short algorithm to calculate these asymptotically optimal points in practice. Numerical experiments indicate that they are very close to optimal even when only six or seven design points are calculated.     

Planning Life Tests Based on Progressively Type-I Grouped Censored Data from the Weibull Distribution

In this article, we apply the simulated annealing algorithm to determine optimally spaced inspection times for the two-parameter Weibull distribution for any given progressive Type-I grouped censoring plan. We examine how the asymptotic relative efficiencies of the estimates are affected by the position of the monitoring points and the number of monitoring points used. A comparison of different inspection plans is made that will enable the user to select a plan for a specified quality goal. Using the same algorithm, we can also determine an optimal progressive Type-I grouped censoring plan when the inspection times and the expected proportions of total failures in the experiment are pre-fixed. Finally, we discuss the sample size and the acceptance constant of the progressively Type-I grouped censored reliability sampling plan when the optimal inspection times are used.     

A Comparison of Three-Level Orthogonal Arrays in the Presence of Different Correlation Structures in Observations

When the experimenter suspects that there might be a quadratic relation between the response variable and the explanatory parameters, a design with at least three points must be employed to establish and explore this relation (second-order design). Orthogonal arrays (OAs) with three levels are often used as second-order response surface designs. Generally, we assume that the data are independent observations; however, there are many situations where this assumption may not be sustainable. In this paper, we want to compare three-level OAs with 18, 27, and 36 runs under the presence of three specific forms of correlation in observations. The aim is to derive the best designs that can be efficiently used for response surface modeling.     

Highly Efficient Designs for Logistic Models with Categorical Variables

Optimal designs for logistic models generally require prior information about the values of the regression parameters. However, experimenters usually do not have full knowledge of these parameters. We propose a design that is D-optimal on a restricted design region. This design assigns an equal weight to design points that contain more information and ignores those design points that contain less information about the regression parameters. The design can be constructed in practice by means of the rank order of the outcome variances. A numerical study compares the proposed design with the D-optimal and completely balanced designs in terms of efficiency.     

Reverse Foldovers for Blocked 2 m−k Fractional Factorial Designs

Two-level regular fractional factorial designs are often used in industry as screening designs to help identify early on in an experimental process those experimental or system variables which have significant effects on the process being studied. When the experimental material to be used in the experiment is heterogenous or the experiment must be performed over several well-defined time periods, blocking is often used as a means to improve experimental efficiency by removing the possible effects of heterogenous experimental material or possible time period effects. In a recent article, Li and Jacroux (2007 Li , F. , Jacroux , M. (2007). Optimal foldover plans for blocked 2 ^m?k fractional factorial designs. J. Statsist. Plann. Infer 137:2434–2452. [Google Scholar]) suggested a strategy for constructing optimal follow-up designs for blocked fractional factorial designs using the well-known foldover technique in conjunction with several optimality criteria. In this article, we consider the reverse foldover problem for blocked fractional factorial designs. In particular, given a 2^(m+p)?(p+k) blocked fractional factorial design D, we derive simple sufficient conditions which can be used to determine if there exists a 2^{(m+p?1)?(p?1+k+1)} initial fractional factorial design d which yields D as a foldover combined design as well how to generate all such d. Such information is useful in developing an overall experimental strategy in situations where an experimenter wants an overall blocked fractional factorial design with “desirable” properties but also wants the option of analyzing the observed data at the halfway mark to determine if the significant experimental variables are obvious (and the experiment can be terminated) or if a different path of experimentation should be taken from that initially planned.     

The Optimality of the Expert and Majority Rules Under Exponentially Distributed Competence

We study the uncertain dichotomous choice model. In this model a set of decision makers is required to select one of two alternatives, say support or reject a certain proposal. Applications of this model are relevant to many areas, such as political science, economics, business and management. The purpose of this paper is to estimate and compare the probabilities that different decision rules may be optimal. We consider the expert rule, the majority rule and a few in-between rules. The information on the decisional skills is incomplete, and these skills arise from an exponential distribution. It turns out that the probability that the expert rule is optimal far exceeds the probability that the majority rule is optimal, especially as the number of the decision makers becomes large.     

The Theory of Optimal Delegation With an Application to Tariff Caps

We consider a general representation of the delegation problem, with and without money burning, and provide sufficient and necessary conditions under which an interval allocation is optimal. We also apply our results to the theory of trade agreements among privately informed governments. For both perfect and monopolistic competition settings, we provide conditions under which tariff caps are optimal.