首页> 外文会议>Annual European symposium on algorithms >Revenue Maximization for Selling Multiple Correlated Items
【24h】

Revenue Maximization for Selling Multiple Correlated Items

机译:销售多个相关项目的收益最大化

获取原文

摘要

We study the problem of selling n items to a single buyer with an additive valuation function. We consider the valuation of the items to be correlated, i.e., desirabilities of the buyer for the items are not drawn independently. Ideally, the goal is to design a mechanism to maximize the revenue. However, it has been shown that a revenue optimal mechanism might be very complicated and as a result inapplicable to real-world auctions. Therefore, our focus is on designing a simple mechanism that achieves a constant fraction of the optimal revenue. Babaioff et al. propose a simple mechanism that achieves a constant fraction of the optimal revenue for independent setting with a single additive buyer. However, they leave the following problem as an open question: "Is there a simple, approximately optimal mechanism for a single additive buyer whose value for n items is sampled from a common base-value distribution?" Babaioff et al. show a constant approximation factor of the optimal revenue can be achieved by either selling the items separately or as a whole bundle in the independent setting. We show a similar result for the correlated setting when the desirabilities of the buyer are drawn from a common base-value distribution. It is worth mentioning that the core decomposition lemma which is mainly the heart of the proofs for efficiency of the mechanisms does not hold for correlated settings. Therefore we propose a modified version of this lemma which is applicable to the correlated settings as well. Although we apply this technique to show the proposed mechanism can guarantee a constant fraction of the optimal revenue in a very weak correlation, this method alone can not directly show the efficiency of the mechanism in stronger correlations. Therefore, via a combinatorial approach we reduce the problem to an auction with a weak correlation to which the core decomposition technique is applicable. In addition, we introduce a generalized model of correlation for items and show the proposed mechanism achieves an O(log k) approximation factor of the optimal revenue in that setting.
机译:我们研究了将n个项目出售给具有附加估值功能的单个买家的问题。我们认为要关联的商品的估价,即,买家对商品的期望不是独立绘制的。理想情况下,目标是设计一种使收入最大化的机制。但是,已经表明,收益最佳机制可能非常复杂,因此不适用于现实世界的拍卖。因此,我们的重点是设计一种能够实现最佳收益恒定比例的简单机制。 Babaioff等。提出了一种简单的机制,该机制可以通过单个添加剂购买者实现独立设置的最优收入的恒定比例。但是,他们将以下问题作为一个悬而未决的问题:“对于一个添加剂购买者来说,是否有一种简单的,近似最优的机制,其n个项目的价值是从一个共同的基值分布中采样的?” Babaioff等。展示了最佳收益的恒定近似值,可以通过单独出售这些商品或在独立设置中作为一个整体出售这些商品来实现。从共同的基值分布中得出购买者的需求时,我们对相关设置显示了相似的结果。值得一提的是,核心分解引理(主要是机制有效性证明的核心)不适用于相关设置。因此,我们提出了该引理的修改版本,它也适用于相关设置。尽管我们应用此技术来证明所提出的机制可以在非常弱的相关性中保证最优收益的恒定比例,但是仅此方法不能直接在更强的相关性中显示该机制的效率。因此,通过组合方法,我们将问题简化为可应用核心分解技术的,具有弱相关性的拍卖。此外,我们引入了项目的相关性的广义模型,并证明了所提出的机制在该设置下获得了最佳收益的O(log k)逼近因子。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号