Robust inference in first-price auctions: Overbidding as an identifying restriction
一价拍卖中的稳健推断:以过度竞价作为识别限制AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要以拍卖行为限制识别潜在估值分布,并界定保留价变化下的结构性反事实收入。
一价拍卖中的稳健推断:以过度竞价作为识别限制AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Laboratory experiments find consistently that bidding in first-price auctions tends to be more aggressive than predicted by the risk-neutral Bayesian Nash Equilibrium (RNBNE) — a finding known as the overbidding puzzle. Several alternative models can explain the overbidding puzzle, but no canonical alternative to RNBNE has emerged. Instead of estimating a particular model of overbidding, we use the overbidding restriction itself for identification, which allows us to bound the valuation distribution and the seller’s revenue under counterfactual reserve prices in the spirit of Haile and Tamer (2003). These bounds are consistent with RNBNE and all models of overbidding, and the bounds remain valid even if there is unobserved heterogeneity in bidding strategies. We evaluate the validity of the bounds numerically and in experimental data.