论文检索

以分位数为目标的有限样本极小极大遗憾处理规则AI 解读

Consider a setup in which a decision maker is informed about the population by a finite sample and based on that sample has to decide whether or not to apply a certain treatment. We work out finite sample minimax regret treatment rules under various sampling schemes when outcomes are restricted onto the unit interval. In contrast to Stoye (2009) where the focus is on maximization of expected utility the focus here is instead on a particular quantile of the outcome…

通过虚拟博弈数值逼近极小极大遗憾规则AI 解读

Finding numerical approximations to minimax regret treatment rules is of key interest. To do so when potential outcomes are in {0,1} we discretize the action space of nature and apply a variant of Robinson's (1951) algorithm for iterative solutions for finite two-person zero sum games. Our approach avoids the need to evaluate regret of each treatment rule in each iteration. When potential outcomes are in [0,1] we apply the so-called coarsening approach. We consider a…

条件异方差下线性工具变量回归的高功效子向量 Anderson–Rubin 检验AI 解读

We introduce a new test for a two-sided hypothesis involving a subset of the structural parameter vector in the linear instrumental variables (IVs) model. Guggenberger et al. (2019), GKM19 from now on, introduce a subvector Anderson-Rubin (AR) test with data-dependent critical values that has asymptotic size equal to nominal size for a parameter space that allows for arbitrary strength or weakness of the IVs and has uniformly nonsmaller power than the projected AR test…