Maximizing revenue in the presence of intermediaries

11/19/2021
by   Gagan Aggarwal, et al.
0

We study the mechanism design problem of selling k items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of buyers. Our goal is to design robust mechanisms that are independent of the demand structure (i.e. how the buyers are partitioned across intermediaries), and perform well under a wide variety of possible contracts between intermediaries and buyers. We first study the case of k identical items where each buyer draws its private valuation for an item i.i.d. from a known λ-regular distribution. We construct a robust mechanism that, independent of the demand structure and under certain conditions on the contracts between intermediaries and buyers, obtains a constant factor of the revenue that the mechanism designer could obtain had she known the buyers' valuations. In other words, our mechanism's expected revenue achieves a constant factor of the optimal welfare, regardless of the demand structure. Our mechanism is a simple posted-price mechanism that sets a take-it-or-leave-it per-item price that depends on k and the total number of buyers, but does not depend on the demand structure or the downstream contracts. Next we generalize our result to the case when the items are not identical. We assume that the item valuations are separable. For this case, we design a mechanism that obtains at least a constant fraction of the optimal welfare, by using a menu of posted prices. This mechanism is also independent of the demand structure, but makes a relatively stronger assumption on the contracts between intermediaries and buyers, namely that each intermediary prefers outcomes with a higher sum of utilities of the subset of buyers represented by it.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2022

Buy-Many Mechanisms for Many Unit-Demand Buyers

A recent line of research has established a novel desideratum for design...
research
03/02/2021

Prior-free Dynamic Mechanism Design With Limited Liability

We study the problem of repeatedly auctioning off an item to one of k bi...
research
07/19/2022

Prior-Independent Auctions for Heterogeneous Bidders

We study the design of prior-independent auctions in a setting with hete...
research
09/13/2018

A Simple Mechanism for a Budget-Constrained Buyer

We study a classic Bayesian mechanism design setting of monopoly problem...
research
09/24/2020

Selling Two Identical Objects

It is well-known that optimal (i.e., revenue-maximizing) selling mechani...
research
05/03/2023

Stackelberg Attacks on Auctions and Blockchain Transaction Fee Mechanisms

We study an auction with m identical items in a context where n agents c...
research
02/17/2023

Contests as Optimal Mechanisms under Signal Manipulation

We study the distribution of multiple homogeneous items to multiple agen...

Please sign up or login with your details

Forgot password? Click here to reset