Identification and Estimation of Online Price Competition With an Unknown Number of Firms
竞争企业数量未知时在线价格竞争模型的识别与估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要围绕价格竞争模型的参数识别与估计,并以估计模型模拟竞争变化对消费者价格的影响,因此归入结构估计。
竞争企业数量未知时在线价格竞争模型的识别与估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Summary This paper considers identification and estimation of a general model for online price competition. We show that when the number of competing firms is unknown the underlying parameters of the model can still be identified and estimated employing recently developed results on measurement errors. We illustrate our methodology using UK data for personal digital assistants and employ the estimates to simulate competitive effects. Our results reveal that heightened competition has differential effects on the prices paid by different consumer segments. Copyright © 2015 John Wiley & Sons, Ltd.
集体家庭消费中的规模经济
ABSTRACT Browning et al. (2013) model collective‐household economies of scale in goods consumption by having each good be partly shared, instead of each good being public or private. We modify their model to achieve simple point identification and estimation of the economies of scale of consumption of each good, and we provide a new index of household level economies of scale. Our model has a linear form, permits households of varying composition, including children, and…
扰动效用模型的 Fenchel–Young 估计量
Perturbed Utility Models (PUMs) represent discrete choice as utility maximization under convex perturbation or regularization, encompassing a broad class of choice models, including Multinomial Logit (MNL) and models that permit zero choice probabilities. Because, for general perturbations, maximum likelihood may be non-convex, and the negative log-likelihood is infinite when a sparse model assigns zero probability to an observed choice, we specialize the Fenchel--Young…
熵正则化最优传输下的部分识别
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…
未观测竞争下的第一价格拍卖非参数识别:密度断点框架
We consider nonparametric identification of independent private value first-price auction models, in which the analyst only observes winning bids. Our benchmark model assumes an exogenous number of bidders N. We show that, if the bidders observe N, the resulting discontinuities in the winning bid density can be used to identify the distribution of N. The private value distribution can be nonparametrically identified in a second step. This extends, under testable…
利用成交价格进行有限样本拍卖推断
We first provide inference on the quantile function of the bid distribution in firstprice or descending auctions, and the quantile function of the value distribution in second-price or ascending auctions, with a known number of bidders with symmetric independent private values. Specifically, we provide finite-sample, nonparametric, tuning parameter-free, uniform confidence bands for these quantile functions when observing only the transaction price. We also show how these…
含要素增强型技术的生产函数估计:加成率的应用
I develop a new method for estimating production functions with laboraugmenting technology and apply it to markup estimation. The method imposes limited parametric restrictions and generalizes prior approaches that rely on the CES production function. I first extend the canonical Olley-Pakes framework assumptions to multidimensional productivity and then develop an identification strategy based on a control variable approach and first-order conditions. I use this method to…