DeepAI AI Chat
Log In Sign Up

99% Revenue via Enhanced Competition

01/09/2018
by   Michal Feldman, et al.
Tel Aviv University
Harvard University
0

A sequence of recent studies show that even in the simple setting of a single seller and a single buyer with additive, independent valuations over m items, the revenue-maximizing mechanism is prohibitively complex. This problem has been addressed using two main approaches: (i) Approximation: the best of two simple mechanisms (sell each item separately, or sell all the items as one bundle) gives 1/6 of the optimal revenue [BILW14]. (ii) Enhanced competition: running the simple VCG mechanism with additional m buyers extracts at least the optimal revenue in the original market [EFFTW17]. Both approaches, however, suffer from severe drawbacks: On the one hand, losing 83% of the revenue is hardly acceptable in any application. On the other hand, attracting a linear number of new buyers may be prohibitive. Our main result is that by combining the two approaches one can achieve the best of both worlds. Specifically, for any constant ϵ one can obtain a (1-ϵ) fraction of the optimal revenue by running simple mechanisms --- either selling each item separately or selling all items as a single bundle --- with substantially fewer additional buyers: logarithmic, constant, or even none in some cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/10/2017

A Note on Approximate Revenue Maximization with Two Items

We consider the problem of maximizing revenue when selling 2 items to a ...
09/13/2018

A Simple Mechanism for a Budget-Constrained Buyer

We study a classic Bayesian mechanism design setting of monopoly problem...
06/21/2019

Simple Mechanisms for Profit Maximization in Multi-item Auctions

We study a classical Bayesian mechanism design problem where a seller is...
09/11/2017

On Revenue Monotonicity in Combinatorial Auctions

Along with substantial progress made recently in designing near-optimal ...
12/05/2018

Optimal (and Benchmark-Optimal) Competition Complexity for Additive Buyers over Independent Items

The Competition Complexity of an auction setting refers to the number of...
06/21/2021

On Simple Mechanisms for Dependent Items

We study the problem of selling n heterogeneous items to a single buyer,...
05/29/2019

Robust Stackelberg buyers in repeated auctions

We consider the practical and classical setting where the seller is usin...