Revenue Maximization for Selling Multiple Correlated Items

• Published in: Algorithms - ESA 2015 Vol. 9294; pp. 95 - 105
• Main Authors: Bateni, MohammadHossein, Dehghani, Sina, Hajiaghayi, MohammadTaghi, Seddighin, Saeed
• Format: Book Chapter
• Language: English
• Published: Germany Springer Berlin / Heidelberg 01.01.2015; Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Computer programming / software development; Constant Approxi; Constant Fraction; Discrete mathematics; Independent Setting; Optimal Mechanism; Programming & scripting languages: general; Revenue Maximization
• ISBN: 3662483491; 9783662483497
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-662-48350-3_9

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. [3] 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(logk) approximation factor of the optimal revenue in that setting.