A comparison of sequential treatment allocation rules
序贯处理分配规则的比较AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究双臂老虎机的序贯分配与优劣识别,未明确讨论因果效应估计或其他所列细分方向。
反馈分类问题序贯处理分配规则的比较AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
An experiment is considered which consists of a series of trials, where at each trial one of two treatments must be used, the outcome, ‘success’ or ‘failure’, being known immediately; this is often referred to as a ‘two-armed bandit’. It is required to find a rule for choosing a treatment at each trial which meets, as far as possible, two objectives: (a) to maximize the use of the better treatment, and (b) to minimize the probability of wrongly identifying the better treatment at the end of the experiment. A number of such rules are compared using computer simulation and it is found that an easy-to-use rule based on a dynamic allocation index performs well for a wide range of model parameters.