Prior-Free Blackwell
无先验的 Blackwell 信息比较AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于通用决策与部分识别理论,未提供归入所列具体计量方向的充分依据。
无先验的 Blackwell 信息比较AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This paper develops a prior-free model of data-driven decision making in which the decision maker observes the entire distribution of signals generated by a known experiment under an unknown distribution of the state variable and evaluates actions according to their worst-case payoff over the set of state distributions consistent with that observation. We show how our model applies to partial identification in econometrics and propose a ranking of experiments in which E is robustly more informative than E' if the value of the decision maker's problem after observing E is always at least as high as the value of the decision maker's problem after observing E'. This comparison, which is strictly weaker than Blackwell's classical order, holds if and only if the null space of E is contained in the null space of E'.
Experiments with spillovers create incentives for strategic behavior: when one household member's treatment can affect another, take-up decisions become interdependent. We propose an instrumental-variables framework grounded in game theory, in which take-up is a Nash equilibrium among a small number of agents, and all variables are discrete. Under minimal assumptions, without specifying how equilibria are selected, we derive sharp non-parametric bounds for direct, indirect,…
不完美测量下的部分识别:分布鲁棒方法
Imperfect measurements allow different underlying distributions to generate the same observations. Restrictions linking unobserved components can make it difficult to characterize all compatible distributions and compute the resulting range of parameter values. We ask how to construct computable parameter bounds and tighten them without additional data or stronger assumptions. We develop a general framework for partial identification under imperfect measurement based on…
利用补充样本识别面板条件化:锐界与设计假设
Refreshment samples are the standard remedy for panel attrition, and the identification results behind them maintain that participation does not change measurement. We characterize what a refreshment sample identifies about panel conditioning, modelled as a deterministic monotone map at reinterview, when attrition is unrestricted. A candidate map is consistent with the data if and only if the retention-scaled distribution of the stayers' implied latent outcomes is setwise…
熵正则化最优传输下的部分识别
In many statistical settings, the available data and maintained assumptions do not suffice to uniquely identify the model parameters of interest. In such cases, one can only identify sets which are guaranteed to contain the true parameters. These are often characterized through linear programs that optimize over models compatible with the observed data. These programs can be infinite-dimensional in the optimizer and the number of constraints. We provide a unified way to…
离散选择面板模型中平均效应的界
In discrete choice panel data, estimation of average effects is crucial for quantifying the effect of covariates, and for policy evaluation and counterfactual analysis. However, in short panels with individual-specific effects, challenges arise due to partial identification and the incidental parameter problem. In particular, estimating the sharp identified set of average effects becomes impractical when covariates have large support sets, such as when they are continuous.…
多控制变量下工资不平等界的去偏推断
We study estimation and inference for a partially identified parameter whose identified set depends on a first-stage nuisance parameter that must itself be estimated. Combining the criterion-function approach with the theory of Neyman-orthogonal moments that underlies double/debiased machine learning, we propose a two-step procedure: the point-identified nuisance is estimated by flexible machine-learning methods, and the set-identified target is recovered as a level set of a…