Nested Bundling
研究了当消费者在单一维度上存在差异时，嵌套捆绑（更贵的套餐包含更便宜套餐的所有商品）何时最优，并给出了确定最优嵌套菜单的算法。
A nested bundling strategy creates menus in which more expensive bundles include all the goods of less expensive ones. We study when nested bundling is optimal and determine which nested menu is optimal, when consumers differ in one dimension. We define a partial order on bundles by (i) set inclusion and (ii) sales quantity when sold alone. We show that, under quasi-concavity assumptions, if the undominated bundles with respect to this partial order are nested, then nested bundling is optimal. We present an iterative algorithm that identifies the minimal optimal menu consisting of a subset of the undominated bundles.