Hi,
Thank you very much for the quick replies, I'm very impressed.
I've been bashing my head against this for a while, so it's fantastic
to find people responding so readily. Thank you :-)
Maybe if I explain a little more about what I'm doing that might
help. Some of your answers above were a bit over my head
I have N distributions (not sure if that's the right word). I can
take values from each to build up samples, but generating values is
extremely expensive. I need to decide which distribution has the
lowest mean with the fewest possible samples.
So, essentially I am racing the distributions, adding values to
the samples from each. Whenever a distribution looks (by a t-test) to
be worse than one of the others then it gets knocked out of the race
(I'm using a bonferroni adjustment in some experiments). The idea is
to keep adding values to the samples from each distribution still in
the race until only one is left.
But, since there are likely to be some distributions that are very
close to each other (or maybe identical) I need to 'drop out' early
when I detect that the samples from the set of distributions still in
the race are nearly equal (to some parameter), otherwise I'd end
growing the samples forever. So, my algorithm can return some number
of the distributions as being 'best or good enough'.
I was initially hoping that the anova would tell me if the
remaining candidates were roughly equal, but as you point out, it
doesn't.
The distributions are roughly normal - after application of an
alpha trim and a box-cox transform.
My probability theory isn't very good - probably :-)
Does any of that help to see what I'm fumbling with?
The closer the means, the more values you have to add to get a