Competitive prizes: when less scrutiny induces more effort

We consider a principal who is keen to induce his agents to work at their maximal effort levels. To this end, he samples n days at random out of the T days on which they work, and awards a prize of B dollars to the most productive agent. The principal’s policy (B, n) induces a strategic game Γ(B, n) between the agents. We show that to implement maximal effort levels weakly (or, strongly) as a strategic equilibrium (or, as dominant strategies) in Γ(B, n), at the least cost B to himself, the principal must choose a small sample size n. Thus less scrutiny by the principal induces more effort from the agents.The need for reduced scrutiny becomes more pronounced when agents have information of the history of past plays in the game. There is an inverse relation between information and optimal sample size. As agents acquire more information (about each other), the principal, so to speak, must “undo” this by reducing his information (about them) and choosing the sample size n even smaller.     

ON THE DISTRIBUTIONS OF ORDER STATISTICS FOR A RANDOM SAMPLE SIZE*

The probability distribution of the i –th and j–th order statistics and of the range R of a sample of size n, taken from a population with probability density function f (x) have been obtained when the sample size n is a random variable N and has: (i) a generalized Poisson distribution; and (ii) a generalized negative bonimial distribution. Specific results are then obtained; (a) when f (x) is uniform over (0,1); and (b) when f(x) is exponential. All the results for N, being a Poisson, binomial and negative binomial rv follow as special cases.     

Comparisons of control schemes for monitoring the means of processes subject to drifts

Although statistical process control (SPC) techniques have been focused mostly on detecting step (constant) mean shift, drift which is a time-varying change frequently occurs in industrial applications. In this research, for monitoring drift change, the following five control schemes are compared: the exponentially weighted moving average (EWMA) chart and the cumulative sum (CUSUM) charts which are recommended detecting drift change in the literature; the generalized EWMA (GEWMA) chart proposed by Han and Tsung (2004) and two generalized likelihood ratio based schemes, GLR-S and GLR-L charts which are respectively under the assumption of step and linear trend shifts. Both the asymptotic estimation and the numerical simulation of the average run length (ARL) are presented. We show that when the in-control (IC) ARL is large (goes to infinity), the GLR-L chart has the best overall performance among the considered charts in detecting linear trend shift. From the viewpoint of practical IC ARL, based on the simulation results, we show that besides the GLR-L chart, the GEWMA chart offers a good balanced protection against drifts of different size. Some computational issues are also addressed.     

On maximum likelihood prediction based on Type II doubly censored exponential data

In this paper, the maximum likelihood predictor (MLP) of the kth ordered observation, t _k, in a sample of size n from a two-parameter exponential distribution as well as the predictive maximum likelihood estimators (PMLE's) of the location and scale parameters, θ and β, based on the observed values t _r, …, t _s (1≤r≤s<k≤n), are obtained in closed forms, contrary to the belief they cannot be so expressed. When θ is known, however, the PMLE of β and MLP of t _k do not admit explicit expressions. It is shown here that they exist and are unique; sharp lower and upper bounds are also provided. The derived predictors and estimators are reasonable and also have good asymptotic properties. As applications, the total duration time in a life test and the failure time of a k-out-of-n system may be predicted. Finally, an illustrative example is included. Received: August 1999     

Hotelling’s <Emphasis Type="Italic">T</Emphasis><Superscript>2</Superscript> control chart with two adaptive sample sizes

Some quality control schemes have been developed when several related quality characteristics are to be monitored. The familiar multivariate process monitoring and control procedure is the Hotelling’s T ² control chart for monitoring the mean vector of the process. It is a direct analog of the univariate shewhart [`(x)]{\bar{x}} chart. As in the case of univariate, the ARL improvements are very important particularly for small process shifts. In this paper, we study the T ² control chart with two-state adaptive sample size, when the shift in the process mean does not occur at the beginning but at some random time in the future. Further, the occurrence time of the shift is assumed to be exponentially distributed random variable.     

Structural instability of the core

Let σ be a q-rule, where any coalition of size q, from the society of size n, is decisive. Let w(n,q)= 2q-n+1 and let W be a smooth ‘policy space’ of dimension w. Let U(W)^N be the space of all smooth profiles on W, endowed with the Whitney topology. It is shown that there exists an ‘instability dimension’ w^*(σ) with 2w^*(σ)w(n,q) such that:

1. (i) if ww^*(σ), and W has no boundary, then the core of σ is empty for a dense set of profiles in U(W)^N (i.e., almost always),

2. (ii) if ww^*(σ)+1, and W has a boundary, then the core of σ is empty, almost always,

3. (iii) if ww^*(σ)+1 then the cycle set is dense in W, almost always,

4. (iv) if ww^*(σ)+2 then the cycle set is also path connected, almost always.

The method of proof is first of all to show that if a point belongs to the core, then certain generalized symmetry conditions in terms of ‘pivotal’ coalitions of size 2q−n must be satisfied. Secondly, it is shown that these symmetry conditions can almost never be satisfied when either W has empty boundary and is of dimension w(n,q) or when W has non-empty boundary and is of dimension w(n,q)+1.     

A note on the comparison between simple random sampling with and without replacement

Summary A new approach is suggested for comparing SRSWR and SRSWOR: SRSWR of integral expected sample size,n, is defined and is compared with SRSWOR of sizen, using suitable estimators.     

Performance of cumulative sum schemes for monitoring low count-level processes

In many instances attributes data must be used to monitor a manufacturing (or other) process that, in normal conditions, should operate at very low count levels for defects. Lucas (1989) has directed attention to this problem, and has investigated a new control scheme for low count-level processes. An alternative scheme is proposed, based on a Cumulative Sum (CUSUM) of the number (termed Run-Length) of successive samples having zero count-levels between samples having at least one count. Using the criterion of Average Run Length (the average number of samples until a signal is generated) comparisons of the Lucas scheme and the Run-Length CUSUM scheme indicate that ARL values for the Run-Length CUSUM can be up to 50% lower.     

Slow convergence of the number of near-maxima for Burr XII distributions

A near-maximum is an observation which falls within a distance a of the maximum observation in an independent and identically distributed sample of size n. Subject to some conditions on the tail thickness of the population distribution, the number K _n (a) of near-maxima is known to converge in probability to one or infinity, or in distribution to a shifted geometric law. In this paper we show that for all Burr XII distributions K _n (a) converges almost surely to unity, but this convergence property may not become clear under certain cases even for very large n. We explore the reason of such slow convergence by studying a distributional continuity between Burr XII and Weibull distributions. We have also given a theoretical explanation of slow convergence of K _n (a) for the Burr XII distributions by showing that the rate of convergence in terms of P{K _n (a) > 1} tending to zero changes very little with the sample size n. Illustrations of the limiting behaviour K _n (a) for the Burr XII and the Weibull distributions are given by simulations and real data. The study also raises an important issue that although the Burr XII provides overall better fit to a given data set than the Weibull distribution, cautions should be taken for the extrapolation of the upper tail behaviour in the case of slow convergence.      

Run length distributions for estimated attributes charts

Attributes control charts, such as c and p charts, are popular methods for detecting out of control signals when it is practical only to obtain qualitative information about a process; in such cases, variables control charts, such as the , s and R charts, cannot be used. The run length distributions have previously been studied for variables charts when the control limits have been estimated. Little has been done in the case of attributes charts. In this paper, the run length distributions for the c chart and p chart are derived for the case when the control limits are estimated. It is shown that, as for variables charts, the effect of estimation on quantities such as the average run length (ARL) can be quite dramatic, but when the underlying process is in control, the ARL is potentially misleading as a basis for comparison. Received: September 1998     

Two-sample rank tests with truncated populations

LetX ₁,…,X _m andY ₁,…,Y _n be two independent samples from continuous distributionsF andG respectively. Using a Hoeffding (1951) type theorem, we obtain the distributions of the vector S=(S ₍₁₎,…,S _(n)), whereS _(j)=# (X _i ’s≤Y _(j)) andY _(j) is thej-th order statistic ofY sample, under three truncation models: (a)G is a left truncation ofF orG is a right truncation ofF, (b)F is a right truncation ofH andG is a left truncation ofH, whereH is some continuous distribution function, (c)G is a two tail truncation ofF. Exploiting the relation between S and the vectorR of the ranks of the order statistics of theY-sample in the pooled sample, we can obtain exact distributions of many rank tests. We use these to compare powers of the Hajek test (Hajek 1967), the Sidak Vondracek test (1957) and the Mann-Whitney-Wilcoxon test. We derive some order relations between the values of the probagility-functions under each model. Hence find that the tests based onS ₍₁₎ andS _(n) are the UMP rank tests for the alternative (a). We also find LMP rank tests under the alternatives (b) and (c).     

On the generalization of Rao,Hartley and Cochran's scheme

Summary The problem considered in this paper is a generalization of the usual Rao, Hartley and Cochran (RHC) scheme. In the usual RHC scheme the population ofN units is randomly divided inton groups wheren is the size of the sample. In this paper we propose to divide the population under consideration into (n+k) random groups wherek is some positive integer. Then a sample ofn groups is selected by using simple random sampling without replacement (SRSWOR). The expressions for the unbiased estimator of population total, its variance and the unbiased estimate of variance have been obtained under the proposed sheme. The condition under which the proposed sheme is more efficient than the usual RHC scheme has also been investigated.     

A consistent test for multivariate normality based on the empirical characteristic function

LetX ₁,X ₂, …,X _n be independent identically distributed random vectors in IR ^d ,d ⩾ 1, with sample mean and sample covariance matrixS _n. We present a practicable and consistent test for the composite hypothesisH _d: the law ofX ₁ is a non-degenerate normal distribution, based on a weighted integral of the squared modulus of the difference between the empirical characteristic function of the residualsS _n ^−1/2 (X _j − ) and its pointwise limit exp (−1/2|t|²) underH _d. The limiting null distribution of the test statistic is obtained, and a table with critical values for various choices ofn andd based on extensive simulations is supplied.     

Linearity of regression for non-adjacent order statistics

Let X ₁,X ₂,…,X _n be a random sample from a continuous distribution with the corresponding order statistics X _1:n≤X _2:n≤…≤X _n:n. All the distributions for which E(X _{k+r: n}|X _k:n)=a X _k:n+b are identified, which solves the problem stated in Ferguson (1967). Received February 1998     

Density estimates of low bias

Two methods are given for adapting a kernel density estimate to obtain an estimate of a density function with bias O(h ^p ) for any given p, where h = h(n) is the bandwidth and n is the sample size. The first method is standard. The second method is new and involves use of Bell polynomials. The second method is shown to yield smaller biases and smaller mean squared errors than classical kernel density estimates and those due to Jones et al. (Biometrika 82:327–338, 1995).     

The Limit Distribution of the Bootstrap for the Unit Root Test Statistic when the Residuals are Dependent

In this article, the unit root test for the AR(1) model with dependent residuals is considered. We adopt a bootstrap procedure to bootstrap the residuals with bootstrap sample size m less than the size n of the original sample. Under the assumptions that m → ∞ and m/n → 0, the convergence in probability of the bootstrap distribution function is established. Research supported by National Natural Science Foundation of China (No. 10471126)     

Minimax invariant estimation of a continuous distribution function under entropy loss

For the invariant decision problem of estimating a continuous distribution function F with two entropy loss functions, it is proved that the best invariant estimators d ₀ exist and are the same as the best invariant estimator of a continuous distribution function under the squared error loss function L (F, d)=∫|F (t) −d (t) |² dF (t). They are minimax for any sample size n≥1.     

Increasing sample sizes do not always increase the power of UMPU-tests for 2×2 tables

We consider the uniformly most powerful unbiased (UMPU) one-sided test for the comparison of two proportions based on sample sizes m and n, i.e., the randomized version of Fisher's exact one-sided test. It will be shown that the power function of the one-sided UMPU-test based on sample sizes m and n can coincide with the power function of the UMPU-test based on sample sizes m+1 and n for certain levels on the entire parameter space. A characterization of all such cases with identical power functions is derived. Finally, this characterization is closely related to number theoretical problems concerning Fermat-like binomial equations. Some consequences for Fisher's original exact test will be discussed, too.     

On the upper and lower semicontinuity of the Aumann integral

Let (T,τ,μ) be a finite measure space, X be a Banach space, P be a metric space and let L₁(μ,X) denote the space of equivalence classes of X-valued Bochner integrable functions on (T,τ,μ). We show that if φ:T×P→2^X is a set-valued function such that for each fixed pεP, φ(·,p) has a measurable graph and for each fixed tεT, φ(t,·) is either upper or lower semicontinuous then the Aumann integral of φ, i.e.,∫_Tφ(t,p)dμ(t)= {∫_Tx(t)dμ(t):xεS_φ(p)}, where S_φ(p)= {yεL₁(μ,X):y(t)εφ(t,p)μ−a.e.}, is either upper or lower semicontinuous in the variable p as well. Our results generalize those of Aumann (1965, 1976) who has considered the above problem for X=Rⁿ, and they have useful applications in general equilibrium and game theory.