The Limits of an Information Intermediary in Auction Design

by   Reza Alijani, et al.

We study the limits of an information intermediary in Bayesian auctions. Formally, we consider the standard single-item auction, with a revenue-maximizing seller and n buyers with independent private values; in addition, we now have an intermediary who knows the buyers' true values, and can map these to a public signal so as to try to increase buyer surplus. This model was proposed by Bergemann et al., who present a signaling scheme for the single-buyer setting that raises the optimal consumer surplus, by guaranteeing the item is always sold while ensuring the seller gets the same revenue as without signaling. Our work aims to understand how this result ports to the setting with multiple buyers. Our first result is an impossibility: We show that such a signaling scheme need not exist even for n=2 buyers with 2-point valuation distributions. Indeed, no signaling scheme can always allocate the item to the highest-valued buyer while preserving any non-trivial fraction of the original consumer surplus; further, no signaling scheme can achieve consumer surplus better than a factor of 1/2 compared to the maximum achievable. These results are existential (and not computational) impossibilities, and thus provide a sharp separation between the single and multi-buyer settings. On the positive side, for discrete valuation distributions, we develop signaling schemes with good approximation guarantees for the consumer surplus compared to the maximum achievable, in settings where either the number of agents, or the support size of valuations, is small. Formally, for i.i.d. buyers, we present an O(min(log n, K))-approximation where K is the support size of the valuations. Moreover, for general distributions, we present an O(min(n log n, K^2))-approximation. Our signaling schemes are conceptually simple and computable in polynomial (in n and K) time.



There are no comments yet.


page 1

page 2

page 3

page 4


On the Competition Complexity of Dynamic Mechanism Design

The Competition Complexity of an auction measures how much competition i...

Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal Auction

What fraction of the single item n buyers setting's expected optimal rev...

Smoothed Analysis of Multi-Item Auctions with Correlated Values

Consider a seller with m heterogeneous items for sale to a single additi...

Price of Anarchy of Simple Auctions with Interdependent Values

We expand the literature on the price of anarchy (PoA) of simultaneous i...

Learning Multi-item Auctions with (or without) Samples

We provide algorithms that learn simple auctions whose revenue is approx...

How to Sell Information Optimally: an Algorithmic Study

We investigate the algorithmic problem of selling information to agents ...

Optimal Dynamic Mechanism Design with Stochastic Supply and Flexible Consumers

We consider the problem of designing an expected-revenue maximizing mech...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.