2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) (2014)
Philadelphia, PA, USA
Oct. 18, 2014 to Oct. 21, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2014.11
We consider a monopolist seller with n heterogeneousitems, facing a single buyer. The buyer hasa value for each item drawn independently according to(non-identical) distributions, and his value for a set ofitems is additive. The seller aims to maximize his revenue.It is known that an optimal mechanism in this setting maybe quite complex, requiring randomization  and menusof infinite size . Hart and Nisan  have initiated astudy of two very simple pricing schemes for this setting:item pricing, in which each item is priced at its monopolyreserve; and bundle pricing, in which the entire set ofitems is priced and sold as one bundle. Hart and Nisan have shown that neither scheme can guarantee more thana vanishingly small fraction of the optimal revenue. Insharp contrast, we show that for any distributions, thebetter of item and bundle pricing is a constant-factorapproximation to the optimal revenue. We further discussextensions to multiple buyers and to valuations that arecorrelated across items.
Approximation methods, Additives, Cost accounting, Pricing, Polynomials, Computer science, Runtime
M. Babaioff, N. Immorlica, B. Lucier and S. M. Weinberg, "A Simple and Approximately Optimal Mechanism for an Additive Buyer," 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), Philadelphia, PA, USA, 2014, pp. 21-30.