Robustly Optimal Mechanisms for Selling Multiple Goods
研究了在买家估值分布不确定时，卖家如何设计销售多种商品的最优机制，以最大化最坏情况下的收入，并揭示了支持分类捆绑的分布集性质。
Abstract We study robustly optimal mechanisms for selling multiple items. The seller maximizes revenue against a worst-case distribution of a buyer’s valuations within a set of distributions, called an “ambiguity” set. We identify the exact forms of robustly optimal selling mechanisms and the worst-case distributions when the ambiguity set satisfies various moment conditions on the values of subsets of goods. The analysis reveals general properties of the ambiguity set that justifies categorical bundling, which includes separate sales and pure bundling as special cases.