论文检索

不可忽略流失与补充抽样面板模型中的比例迭代估计与推断AI 解读

In panel data subject to nonignorable attrition, auxiliary (refreshment) sampling may restore full identification under weak assumptions on the attrition process. Despite their generality, these identification strategies have seen limited empirical use, largely because the implied estimation procedure requires solving a functional minimization problem for the target density. When the distributions of the observed data are parametric, we show that this problem can be solved…

利用补充样本检验参数模型中的可观测变量选择假设AI 解读

In panels with sample selection (that may occur due to attrition, nonresponse, etc.), the assumption of selection on observables (missing at random, MAR) is commonly imposed despite often being implausible. However, this assumption becomes testable when a refreshment sample is available. We develop a statistical test of MAR based on a distance between two estimated distributions: one obtained using the standard inverse probability weighting (IPW) that is valid under MAR and…

通过正则化最优传输推断部分识别矩模型AI 解读

Many statistical and econometric problems involve parameters defined by moments of a joint distribution when only marginal distributions are observed, leading naturally to partial identification. We develop a methodology for identification, estimation, and inference in the corresponding partially identified GMM model. We characterize the sharp identified set for the parameter of interest via a support-function/optimal-transport (OT) representation. To estimate the identified…

存在样本流失与补充样本的面板数据闭式估计与推断AI 解读

It has long been established that, if a panel dataset suffers from attrition, auxiliary (refreshment) sampling restores full identification under additional assumptions that still allow for nontrivial attrition mechanisms. Such identification results rely on implausible assumptions about the attrition process or lead to theoretically and computationally challenging estimation procedures. We propose an alternative identifying assumption that, despite its nonparametric nature,…

二元关系模型中的 Kotlarski 引理AI 解读

We show how to identify the distributions of the latent components in the two-way dyadic model for bipartite networks $y_{i,\ell}= α_i+η_{\ell}+\varepsilon_{i,\ell}$. This is achieved by a repeated application of the extension of the classical lemma of Kotlarski (1967) in Evdokimov and White (2012). We provide two separate sets of assumptions under which all the latent distributions are identified. Both rely on some of the latent components being identically distributed.

部分数据缺失下的广义矩估计AI 解读

We consider a generalized method of moments framework in which a part of the data vector is missing for some units in a completely unrestricted, potentially endogenous way. In this setup, the parameters of interest are usually only partially identified. We characterize the identified set for such parameters using the support function of the convex set of moment predictions consistent with the data. This identified set is sharp, valid for both continuous and discrete data,…

第一价格拍卖反事实的非参数推断AI 解读

In a classical model of the first-price sealed-bid auction with independent private values, we develop nonparametric estimators for several policy-relevant targets, such as the bidder's surplus and auctioneer's revenue under counterfactual reserve prices. Motivated by the linearity of these targets in the quantile function of bidders' values, we propose an estimator of the latter and derive its Bahadur-Kiefer expansion. This makes it possible to construct uniform confidence…

分位数密度函数的偏差校正与一致推断AI 解读

For the kernel estimator of the quantile density function (the derivative of the quantile function), I show how to perform the boundary bias correction, establish the rate of strong uniform consistency of the bias-corrected estimator, and construct the confidence bands that are asymptotically exact uniformly over the entire domain $[0,1]$. The proposed procedures rely on the pivotality of the studentized bias-corrected estimator and known anti-concentration properties of the…

半参数离散选择模型的高效反事实估计：一则方法补充AI 解读

I suggest an enhancement of the procedure of Chiong, Hsieh, and Shum (2017) for calculating bounds on counterfactual demand in semiparametric discrete choice models. Their algorithm relies on a system of inequalities indexed by cycles of a large number $M$ of observed markets and hence seems to require computationally infeasible enumeration of all such cycles. I show that such enumeration is unnecessary because solving the "fully efficient" inequality system exploiting…