Internat. J. Math. & Math. Sci.
VOL. 18 NO. (1995) 147-150
147
ASYMPTOTICOPTIMALITY OFSEQUENTIAL
DESIGNS
FORESTIMATIONKAMEL REKAB
D’paltmcntofAtt)lied.klath’matw’
Floxl(la InsttuWofTechnology Melbourne, FL32901
(Received November 5, 1992)
ABSTRACT. This paper is concerned with the problem of allocating a fixed number oftrials between K independent populations from the exponential family, in order toestimate a linear combination of the means wthsquared error loss. Introducing independent conjugatepriors, a batch sequential procedureisproposed andcomparedwth theopnmal.
KEY WORDS AND PHRASES.
Bayes
rusk; Ezponentzalfamhes; Sequential designs;Umform
ntegrabzhty.
1992AMS SUBJECT CLASSIFICATION CODES. 62L05, 62L10
1. INTRODUCTION.
Given K independent populations
P,... ,PK
indexed by unknown parameters o,...,aKrespectively, it is wished to estimate a linear combination of their respective means based on afixed total number of observations M. The problem is one ofallocating the M observations between the K populationsso as to minimizeexpected squarederror loss. Several special cases of thisproblemhave been studied.
Forestimating the difference in two Binomialmeans, Alvo and Cabilio.
(1982)
proposed an allocationprocedure shown to be asymptotically optimal. Rekab(1989)
considered problem ofestimating theproduct ofmeansof twonormal populations. Robbins, Simon, andStarr
(1967)
considered the problem of estimating the difference of the means of two normal populations with unknownmeansand unknown variances. They proposed asampling schemethat has been applied in a variety of sequential estimation problems. Their work was restricted entirely to the ad hoe design. Woodroofe and Hardwick
(1990)
considered the problemof estimating the differencebetweenthemeansof twonormal populationswith ethical costs. Usingaquasi Bayesian approach, theyproposedathreestage procedure shownto beoptimaltosecond order forsquarederrorloss.
In the present article we adopt a fully Bayesian approach to the problemof estimating a linear combinationof themeansof
K
populations from the generalexponential family.A
lower boundon theBayes
risk is derived and shown to be achieved asymptotically as M c by abatch sequentialprocedure.
[48 K. REKAB
’2. THE BAYESIAN .I()DEL.
L,t
P1
P,. 1), K inCh,1),nh,1tlldatiCms
frm the general,xpCmential fimily inh,xel tv(1 (/, r’spectiv’ly. That is.Stl)lse thatflr I(. It is assmed thr(mghlt that is the natm’al parameter space of the and that is len. It iswellknwn that E,,(Xi) t/,’((*,:) andI,(Xi) ’i,"(ci). Let these
trnbeassigned independent conjugate priors, that is suppose that a are independent random wzriables which haw’, distributions
dII((ti) exp{r’ipiai
ri/,(ci)}
c(r,,i) d(ti
wtmre
/
c(ri,p,i) exp{ri/ci-
ri(i)}d.i.
LetMbethe fixed total number of observationsand
M,..., MK
bethe random variables which allocateobservations toP P-
withi Mi
M.In
estimatingci’(i)
withsquarederrorloss, the terminal
Bayes
estimator isi
cii,Mi wherei,Mi isthemeof the posterior distribution/(i)
based onMi
observations. Due to independenceof the priors, the terminal Bayesriskr
isgiven byr E Mi
ci(2.1)
ri
where
Ui,M E{"(i)IXi,,... ,Xi,M,}.
3. LOWER BOUND ON
THE
BAYES RISK.Webeginthis sectionby derivingalowerboundontheriskincurredby the optimalprocedure.
LEMMA
3.1" Letr
be definedasin(2.1).
ThenE(E_I(I
ciV/O"(ai)) ) M+ E//;lr
PROOF:Theterminal
Bayes
riskcanbewritten asthesumofK K
(M + ri)-lE(-
civ/Ui,M,)
i=1 i=1
and
(M+ ri)-lE ((Mi + ri) lcj /U,M, (M + )I , v/Ui,Mi
(Mi + ri)(M1+ r)
i=1 i=1 j=i+l
The lemma followsbythemartingaleproperties of
Ui,Mi.
ASYMPTOTIC OPTIMALITY OF SEQUENTIAL DESIGNS 149
4. A BATCH
SEQUENTIAL
PROCEDURE.In
this section a batch sequential procedure is proposed and shown to be asymptotically optimal. LetM,,b
denote the number of observations sampled from populationP,
up tostage b.Thenatstage bthe
Bayes
risk is minimizedbyK K
=! =I
andachieves its minimumwhen thefollowingequalityissatisfiedfor all and j
weproposeabatch sequentialprocedureas Withamotivationtomove
follows. First start withaninitialsampleof
K
observations,oneobservation from eachpopulation.The remaining M-
K
observationswillbe allocated inB
batches where each batch consistsofK-
1 observations.Suppose
uptobatch bwealreadyobservedMl,b,..., MK,b,
then select one additionalobservationfrom each populationexcluding populationP,
innext batch ifM,, +
r,> max{
Thefollowinglemmasareneeded for theproofofthe theorem.
LEMMA
4.1: Using the proposed batch sequentialprocedure,M,,b
cx almost surely as b-, for all i.PROOF:The batch sequentialprocedurecanbewrittenasfollows: Sampleoneobservation from each populationexcluding
Pi
if(M,,, + ",)I
S[c, v/U,,M,.’-F [cj v"U.,M,,, >
(M,,b + ",)I ,
for allj
#
i.Suppose
thatM,,
isbounded. Then Mj,, arebounded for all j#
i.Hence
wehaveacontradiction.
LEMMA
4.2:For
blargeenough,
letk(’)
sup{k <
b"Mi
IA-ri> max{
ji
for all 1,..., K. Then
i
)<
150 K. REKAB
PROOF.
Ontheotherhand,
M,,b +
r,< M,
k(,) q-r,q-1M,,k(, +
r,Mj,b
+
rM,(, +
rM,,(, +
r -t-, v/U,,M
<
O)+
1-,c.
THEOREM
4.1" Let r, be therisk incurredbythe proposed batchsequential procedure.Suppose
thereexists p> 1 such thatE("(a,))
p<
cxforall 1,...,K., E(E,(I
c,v/"(,)) )
+ o(1/M)
asM---+o.
PROOF: The proof of the theoremwill follow ifweestablish
and
K K
E(-lc, x/U,,M,) E(Ylc, V/"(,))
0 asM
-+o(4.1)
=1 =1
E{
,=, ,=,+((M, + ,)1 , v/U,,,, (M, + r,)(M (M, + + r,) ,) I, v/U,,,)
0(4.2)
as
M
oo. LetM,..., MK
betheMlocation variablesforthe batchsequentiMprocedure. SinceM,
md<,M,
eiformly integrable,(4.1)
issatisfied. UsingLemma (4.2),
M, "(,)
a.s.
Theproofwillbeestablished if
M+r
u’+’(c)2U,M,
isuniforyintegrable. UsingLemma(4.2),
c
M + r r
TheprooffollowsbyDoob’s nequMity fornonnegativesubmtingMes.