English

Approximate Revenue Maximization with Multiple Items

Computer Science and Game Theory 2022-09-22 v3 Theoretical Economics

Abstract

Maximizing the revenue from selling _more than one_ good (or item) to a single buyer is a notoriously difficult problem, in stark contrast to the one-good case. For two goods, we show that simple "one-dimensional" mechanisms, such as selling the goods separately, _guarantee_ at least 73% of the optimal revenue when the valuations of the two goods are independent and identically distributed, and at least 50%50\% when they are independent. For the case of k>2k>2 independent goods, we show that selling them separately guarantees at least a c/log2kc/\log^2 k fraction of the optimal revenue; and, for independent and identically distributed goods, we show that selling them as one bundle guarantees at least a c/logkc/\log k fraction of the optimal revenue. Additional results compare the revenues from the two simple mechanisms of selling the goods separately and bundled, identify situations where bundling is optimal, and extend the analysis to multiple buyers.

Keywords

Cite

@article{arxiv.1204.1846,
  title  = {Approximate Revenue Maximization with Multiple Items},
  author = {Sergiu Hart and Noam Nisan},
  journal= {arXiv preprint arXiv:1204.1846},
  year   = {2022}
}

Comments

Presented in ACM EC conference, 2012

R2 v1 2026-06-21T20:46:31.977Z