A Lower Bound for the Centered <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>-Discrepancy on Asymmetric Factorials and its Application

The role of uniformity measured by the centered L ₂-discrepancy (Hickernell 1998a) has been studied in fractional factorial designs. The issue of a lower bound for the centered L ₂-discrepancy is crucial in the construction of uniform designs. Fang and Mukerjee (2000) and Fang et al. (2002, 2003b) derived lower bounds for fractions of two- and three-level factorials. In this paper we report some new lower bounds for the centered L ₂-discrepancy for a set of asymmetric fraction factorials. Using these lower bounds helps to measure uniformity of a given design. In addition, as an application of these lower bounds, we propose a method to construct uniform designs or nearly uniform designs with asymmetric factorials.     

Construction of equidistant and weak equidistant supersaturated designs

Supersaturated designs (SSDs) have been highly valued in recent years for their ability of screening out important factors in the early stages of experiments. Recently, Liu and Lin (in Statist Sinica 19:197–211, 2009) proposed a method to construct optimal mixed-level SSDs from smaller multi-level SSDs and transposed orthogonal arrays (OAs). This paper extends their method to construct more equidistant optimal SSDs by replacing the multi-level SSDs and transposed OAs with mixed-level SSDs and general transposed difference matrices, respectively, and then proposes two practical methods for constructing weak equidistant SSDs based on this extended method. A large number of new optimal SSDs can be constructed from these three methods. Some examples are provided and more new designs are listed in “Appendix” for practical use.     

Gumbel’s Identity,Binomial Moments,and Bonferroni Sums

Gumbel’s Identity equates the Bonferroni sum with the k ‐ th binomial moment of the number of events M_n which occur, out of n arbitrary events. We provide a unified treatment of familiar probability bounds on a union of events by Bonferroni, Galambos–Rényi, Dawson–Sankoff, and Chung–Erdös, as well as less familiar bounds by Fréchet and Gumbel, all of which are expressed in terms of Bonferroni sums, by showing that all these arise as bounds in a more general setting in terms of binomial moments of a general non‐negative integer‐valued random variable. Use of Gumbel’s Identity then gives the inequalities in familiar Bonferroni sum form. This approach simplifies existing proofs. It also allows generalization of the results of Fréchet and Gumbel to give bounds on the probability that at least t of n events occur for any A further consequence of the approach is an improvement of a recent bound of Petrov which itself generalizes the Chung–Erdös bound.     

Efficient paired choice designs with fewer choice pairs

For paired choice experiments, two new construction methods of designs are proposed for the estimation of the main effects. In many cases, these designs require about 30–50% fewer choice pairs than the existing designs and at the same time have reasonably high D-efficiencies for the estimation of the main effects. Furthermore, as against the existing efficient designs, our designs have higher D-efficiencies for the same number of choice pairs.     

Multi-level k-circulant Supersaturated Designs

In this paper we present a new method for constructing multi-level supersaturated designs with n rows, m columns and the equal occurrence property. We investigate the existence of multi-level supersaturated designs using a single generator vector and its k-cyclic permutations as rows. We find the conditions needed, in order this vector to generate a balanced supersaturated design. These conditions are simplified for the case of three level supersaturated designs. By using the proposed method three level supersaturated designs are constructed and explored. Moreover, many new, optimal and near optimal, multi-level supersaturated designs are provided as well.     

R-optimal designs for multi-factor models with heteroscedastic errors

In this paper, we consider the R-optimal design problem for multi-factor regression models with heteroscedastic errors. It is shown that a R-optimal design for the heteroscedastic Kronecker product model is given by the product of the R-optimal designs for the marginal one-factor models. However, R-optimal designs for the additive models can be constructed from R-optimal designs for the one-factor models only if sufficient conditions are satisfied. Several examples are presented to illustrate and check optimal designs based on R-optimality criterion.     

On simplifying the calculations leading to designs with general minimum lower-order confounding

Motivated by the effect hierarchy principle, Zhang et al. (Stat Sinica 18:1689–1705, 2008) introduced an aliased effect number pattern (AENP) for regular fractional factorial designs and based on the new pattern proposed a general minimum lower-order confounding (GMC) criterion for choosing optimal $2^{n-m}$ designs. Zhang et al. (Stat Sinica 18:1689–1705, 2008) proved that most existing criteria can be obtained by functions of the AENP. In this paper we propose a simple method for the calculation of AENP. The method is much easier than before since the calculation only makes use of the design matrix. All 128-run GMC designs with the number of factors ranging from 8 to 32 are provided for practical use.     

U-type and column-orthogonal designs for computer experiments

U-type designs and orthogonal Latin hypercube designs (OLHDs) have been used extensively for performing computer experiments. Both have good spaced filling properties in one-dimension. U-type designs may not have low correlations among the main effects, quadratic effects and two-factor interactions. On the other hand, OLHDs are hard to be found due to their large number of levels for each factor. Recently, alternative classes of U-type designs with zero or low correlations among the effects of interest appear in the literature. In this paper, we present new classes of U-type or quantitative \(3\) -orthogonal designs for computer experiments. The proposed designs are constructed by combining known combinatorial structures and they have their main effects pairwise orthogonal, orthogonal to the mean effect, and orthogonal to both quadratic effects and two-factor interactions.     

A general construction of E(s 2)-optimal large supersaturated designs

A general method for construction of E(s ²)-optimal, two-level supersaturated designs (SSDs) with the equal occurrence property, from supplementary difference sets is introduced. It is proved that SSDs constructed in this way are E(s ²)-optimal. Comparisons are made with previous works and it is shown that the proposed method gives promising results for the construction of E(s ²)-optimal large SSDs.     

Optimal mixed-level supersaturated design

A supersaturated design is essentially a fractional factorial in which the number of potential effects is greater than the number of runs. In this paper, E(f _NOD ) criterion is employed for comparing supersaturated designs from the viewpoint of orthogonality and uniformity, and a lower bound of E(f _NOD ) which can serve as a benchmark of design optimality is obtained. It is shown that the existing E(s ²) and ave ² criteria (for two- and three-level supersaturated designs respectively) are in fact special cases of this criterion. Furthermore, a construction method for mixed-level supersaturated designs is proposed and some properties of the resulting designs are investigated. Key words:Discrepancy; Hamming distance; Orthogonal array; Supersaturated design; Uniformity; U-type design. 2000 Mathematics Subject Classifications62K15, 62K05, 62K99. Corresponding author.     

Understanding prediction intervals for firm specific inefficiency scores from parametric stochastic frontier models

This paper makes two important contributions to the literature on prediction intervals for firm specific inefficiency estimates in cross sectional SFA models. Firstly, the existing intervals in the literature do not correspond to the minimum width intervals and in this paper we discuss how to compute such intervals and how they either include or exclude zero as a lower bound depending on where the probability mass of the distribution of \( u_{i} |\varepsilon_{i} \) resides. This has useful implications for practitioners and policy makers, with greatest reductions in interval width for the most efficient firms. Secondly, we propose an ‘asymptotic’ approach to incorporating parameter uncertainty into prediction intervals for firm specific inefficiency (given that in practice model parameters have to be estimated) as an alternative to the ‘bagging’ procedure suggested in Simar and Wilson (Econom Rev 29(1):62–98, 2010). The approach is computationally much simpler than the bagging approach.     

Lower Bound Restrictions on Intensities in Data Envelopment Analysis

We propose an extension to the basic DEA models that guarantees that if an intensity is positive then it must be at least as large as a pre-defined lower bound. This requirement adds an integer programming constraint known within Operations Research as a Fixed-Charge (FC) type of constraint. Accordingly, we term the new model DEA_FC. The proposed model lies between the DEA models that allow units to be scaled arbitrarily low, and the Free Disposal Hull model that allows no scaling. We analyze 18 datasets from the literature to demonstrate that sufficiently low intensities—those for which the scaled Decision-Making Unit (DMU) has inputs and outputs that lie below the minimum values observed—are pervasive, and that the new model ensures fairer comparisons without sacrificing the required discriminating power. We explain why the low-intensity phenomenon exists. In sharp contrast to standard DEA models we demonstrate via examples that an inefficient DMU may play a pivotal role in determining the technology. We also propose a goal programming model that determines how deviations from the lower bounds affect efficiency, which we term the trade-off between the deviation gap and the efficiency gap.     

Blocked factor aliased effect-number pattern and column rank of blocked regular designs

In factorial experiments, estimation precision of specific factor effects depends not only on design selection but also on factor assignments to columns of selected designs. Usually, different columns in a design play different roles when estimating factor effects. Zhou et al. (Can J Stat 41:540-555, 2013) introduced a factor aliased effect-number pattern (F-AENP) and proposed a column ranking scheme for all the GMC \(2^{n-m}\) designs with \(5N/16+1\le n\le N-1\), where \(N=2^{n-m}\). In this paper, we first introduce a blocked factor aliased effect-number pattern (B-F-AENP) for blocked regular designs as an extension of the F-AENP. Then, by using the B-F-AENP, we propose a column ranking scheme for all the B\(^1\)-GMC \(2^{n-m}:2^s\) designs with \(5N/16+1\le n\le N-1\), as well as an assignment strategy for important factors.     

Some results on constructing general minimum lower order confounding 2^{n-m} designs for n\le 2^{n-m-2}

Zhang et al. (Stat Sinica 18:1689–1705, 2008) introduced an aliased effect-number pattern for two-level regular designs and proposed a general minimum lower-order confounding (GMC) criterion for choosing optimal designs. All the GMC \(2^{n-m}\) designs with \(N/4+1\le n\le N-1\) were constructed by Li et al. (Stat Sinica 21:1571–1589, 2011), Zhang and Cheng (J Stat Plan Inference 140:1719–1730, 2010) and Cheng and Zhang (J Stat Plan Inference 140:2384–2394, 2010), where \(N=2^{n-m}\) is run number and \(n\) is factor number. In this paper, we first study some further properties of GMC design, then we construct all the GMC \(2^{n-m}\) designs respectively with the three parameter cases of \(n\le N-1\) : (i) \(m\le 4\) , (ii) \(m\ge 5\) and \(n=(2^m-1)u+r\) for \(u>0\) and \(r=0,1,2\) , and (iii) \(m\ge 5\) and \(n=(2^m-1)u+r\) for \(u\ge 0\) and \(r=2^m-3,2^m-2\) .     

Bounds on the efficiency of the residual design of extended BIB designs

This gives a complete proof for bounds of the efficiency, conjectured by Das and Kageyama (1992), on robustness of extended balanced incomplete block designs against the unavailability of any number of observations in a block.     

A note on the estimation of total weight in chemical balance weighing designs

Summary This paper studies the problem of estimation of the total weight of objects using a chemical balance weighing design under the restriction |L−R| ≤a, whereL andR represent the number of objects placed on the left and right pans, respectively. A lower bound for the variance of the estimated total weight is given and a necessary and sufficient condition for this lower bound to be attained is obtained. Finally, weighing designs for which this lower bound is attainable are constructed.     

On Minimally-supported <Emphasis Type="Italic">D</Emphasis>-optimal Designs for Polynomial Regression with Log-concave Weight Function

This paper studies minimally-supported D-optimal designs for polynomial regression model with logarithmically concave (log-concave) weight functions. Many commonly used weight functions in the design literature are log-concave. For example, and exp(−x ²) in Theorem 2.3.2 of Fedorov (Theory of optimal experiments, 1972) are all log-concave. We show that the determinant of information matrix of minimally-supported design is a log-concave function of ordered support points and the D-optimal design is unique. Therefore, the numerically D-optimal designs can be constructed efficiently by cyclic exchange algorithm.     

Comparison of Cramer–Rao lower bounds of variances for at least equal protection of respondents

In this paper, a new randomized response model is proposed, which is shown to have a Cramer–Rao lower bound of variance that is lower than the Cramer–Rao lower bound of variance suggested by Singh and Sedory at equal protection or greater protection of respondents. A new measure of protection of respondents in the setup of the efficient use of two decks of cards, because of Odumade and Singh, is also suggested. The developed Cramer–Rao lower bounds of variances are compared under different situations through exact numerical illustrations. Survey data to estimate the proportion of students who have sometimes driven a vehicle after drinking alcohol and feeling over the legal limit are collected by using the proposed randomization device and then analyzed. The proposed randomized response technique is also compared with a black box technique within the same survey. A method to determine minimum sample size in randomized response sampling based on a small pilot survey is also given.     

A new measure of association between random variables

We propose a new measure of association between two continuous random variables X and Y based on the covariance between X and the log-odds rate associated to Y. The proposed index of correlation lies in the range [\(-1\), 1]. We show that the extremes of the range, i.e., \(-1\) and 1, are attainable by the Fr\(\acute{\mathrm{e}}\)chet bivariate minimal and maximal distributions, respectively. It is also shown that if X and Y have bivariate normal distribution, the resulting measure of correlation equals the Pearson correlation coefficient \(\rho \). Some interpretations and relationships to other variability measures are presented. Among others, it is shown that for non-negative random variables the proposed association measure can be represented in terms of the mean residual and mean inactivity functions. Some illustrative examples are also provided.     

Population monotonic and strategy-proof mechanisms respecting welfare lower bounds

The significance of population monotonicity and welfare bounds is well-recognized in the fair division literature. We consider the welfare bounds that are central to the fair allocation literature, namely, the identical-preferences lower-bound, individual rationality, the stand-alone lower-bound,   and k$k$-fairness. We characterize population monotonic and incentive compatible mechanisms which allocate an object efficiently and respect a welfare lower bound chosen in the fair allocation problem of allocating a collectively owned indivisible good or bad when monetary transfers are possible and preferences are private information.