The Performance of a Sequential Procedure for a Slippage Problem
滑移问题中一种序贯程序的性能AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要涉及正态总体的序贯比较与选择,未说明因果识别或其他所列细分问题。
反馈分类问题滑移问题中一种序贯程序的性能AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Summary The basic problem known as a “Slippage problem” is to decide that none of the k experimental categories is better than the control or decide that a certain category is better. In this paper, a class of asymptotically efficient sequential procedures is proposed when both the error probabilities are controlled at a specified level (see also Srivastava, 1966). Assuming that these populations are normal with unknown variance σ2, the performance of the sequential procedure is studied for moderate sample sizes. The results of the calculation show that these error probabilities are controlled at the specified level for all values of the parameters and d > 0, where d is the amount of slippage. A similar study for the ranking problem has been done by Srivastava and Ogilvie (1968).