Identification and Inference in First-Price Auctions with Risk-Averse Bidders and Selective Entry
风险厌恶竞标者与选择性进入下第一价格拍卖的识别与推断AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要围绕拍卖均衡模型的非参数识别、集合识别推断与结构计算展开。
风险厌恶竞标者与选择性进入下第一价格拍卖的识别与推断AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Abstract We study identification and inference in first-price auctions with risk-averse bidders and selective entry, building on a flexible framework we call the Affiliated Signal with Risk Aversion (AS-RA) model. Assuming exogenous variation in either the number of potential bidders (N) or a continuous instrument (z) shifting opportunity costs of entry, we provide a sharp characterization of the nonparametric restrictions implied by equilibrium bidding. This characterization implies that risk neutrality is nonparametrically testable. In addition, with sufficient variation in both N and z, the AS-RA model primitives are nonparametrically identified (up to a bounded constant) on their equilibrium domains. Finally, we explore new methods for inference in set-identified auction models based on Chen et al. (2018, Econometrica, vol. 86, 1965–2018), as well as novel and fast computational strategies using Mathematical Programming with Equilibrium Constraints. Simulation studies reveal the good finite-sample performance of our inference methods, which can readily be adapted to other set-identified flexible equilibrium models with parameter-dependent support.