A Class of Dominance Solvable Common-Value Auctions
研究一类共同价值拍卖，其中信息信号的最大值是充分统计量，证明这类第二价格拍卖是优势可解的，即通过迭代剔除劣势策略可得到唯一均衡。
Dominant strategies seldom exist in non-cooperative games. Moulin's concept of a dominance solvable game generalizes, dominant strategy without dramatic loss in appeal. We consider a class of common-value auctions characterized by the property that the maximum of a collection of informative signals is a sufficient statistic for the entire collection. We demonstrate that this class of second-price auctions is dominance solvable.