English

Simple Economies are Almost Optimal

Computer Science and Game Theory 2021-06-03 v1

Abstract

Consider a seller that intends to auction some item. The seller can invest money and effort in advertising in different market segments in order to recruit nn bidders to the auction. Alternatively, the seller can have a much cheaper and focused marketing operation and recruit the same number of bidders from a single market segment. Which marketing operation should the seller choose? More formally, let D={D1,,Dn}D=\{\mathcal D_1,\ldots, \mathcal D_n\} be a set of distributions. Our main result shows that there is always DiD\mathcal D_i\in D such that the revenue that can be extracted from nn bidders, where the value of each is independently drawn from Di\mathcal D_i, is at least 12(11e)\frac 1 2 \cdot (1-\frac 1 e) of the revenue that can be obtained by any possible mix of bidders, where the value of each bidder is drawn from some (possibly different) distribution that belongs to DD. We next consider situations in which the auctioneer cannot use the optimal auction and is required to use a second price auction. We show that there is always DiD\mathcal D_i\in D such that if the value of all bidders is independently drawn from Di\mathcal D_i then running a second price auction guarantees a constant fraction of the revenue that can be obtained by a second-price auction by any possible mix of bidders. Finally, we show that for any ε>0\varepsilon>0 there exists a function ff that depends only on ε\varepsilon (in particular, the function does not depend on nn or on the set DD), such that recruiting nn bidders which have at most f(ε)f(\varepsilon) different distributions, all from DD, guarantees (1ε)(1-\varepsilon)-fraction of the revenue that can be obtained by a second-price auction by any possible mix of bidders.

Keywords

Cite

@article{arxiv.2106.01019,
  title  = {Simple Economies are Almost Optimal},
  author = {Amir Ban and Avi Cohen and Shahar Dobzinski and Itai Ashlagi},
  journal= {arXiv preprint arXiv:2106.01019},
  year   = {2021}
}
R2 v1 2026-06-24T02:44:32.580Z