Robust Mechanisms Under Common Valuation
构建了一个信息稳健的拍卖机制来出售共同价值物品，研究了该拍卖在所有竞拍者信息结构和所有均衡下的收入保证，发现随着竞拍者数量增加，收入保证趋近于全部剩余。
I construct an informationally robust auction to sell a common‐value good. I examine the revenue guarantee of an auction over all information structures of bidders and all equilibria. As the number of bidders gets large, the revenue guarantee of my auction converges to the full surplus, regardless of how information changes as more bidders are added. My auction also maximizes the revenue guarantee when there is a single bidder.