A NOTE ON MINIMAX REGRET RULES WITH MULTIPLE TREATMENTS IN FINITE SAMPLES
有限样本多处理决策的极小极大遗憾规则札记AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要围绕不同处理分配机制下的政策处理选择和有限样本决策,直接涉及因果政策决策。
反馈分类问题有限样本多处理决策的极小极大遗憾规则札记AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We study minimax regret treatment rules under matched treatment assignment in a setup where a policymaker, informed by a sample of size N , needs to decide between T different treatments for a T ≥ 2 $T\geq 2$ upper T greater than or equals 2 . Randomized rules are allowed for. We show that the generalization of the minimax regret rule derived in Schlag (2006, ELEVEN—Tests needed for a recommendation , EUI working paper) and Stoye (2009, Journal of Econometrics 151, 70–81) for the case T = 2 $T=2$ upper T equals 2 is minimax regret for general finite T > 2 $T>2$ upper T greater than 2 and also that the proof structure via the Nash equilibrium and the “coarsening” approaches generalizes as well. We also show by example, that in the case of random assignment the generalization of the minimax rule in Stoye (2009, Journal of Econometrics 151, 70–81) to the case T > 2 $T>2$ upper T greater than 2 is not necessarily minimax regret and derive minimax regret rules for a few small sample cases, e.g., for N = 2 $N=2$ upper N equals 2 when T = 3. $T=3.$ upper T equals 3 period In the case where a covariate x is included, it is shown that a minimax regret rule is obtained by using minimax regret rules in the “conditional-on- x ” problem if the latter are obtained as Nash equilibria.