Optimal Deterministic Mechanisms for an Additive Buyer

04/18/2018
by   Moshe Babaioff, et al.
0

We study revenue maximization by deterministic mechanisms for the simplest case for which Myerson's characterization does not hold: a single seller selling two items, with independently distributed values, to a single additive buyer. We prove that optimal mechanisms are submodular and hence monotone. Furthermore, we show that in the IID case, optimal mechanisms are symmetric. Our characterizations are surprisingly non-trivial, and we show that they fail to extend in several natural ways, e.g. for correlated distributions or more than two items. In particular, this shows that the optimality of symmetric mechanisms does not follow from the symmetry of the IID distribution.

READ FULL TEXT

page 8

page 14

page 15

research
05/28/2022

Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling

Multi-item optimal mechanisms are known to be extremely complex, often o...
research
07/09/2019

Robust Revenue Maximization Under Minimal Statistical Information

We study the problem of multi-dimensional revenue maximization when sell...
research
02/15/2020

Optimal Mechanism Design for Single-Minded Agents

We consider revenue-optimal mechanism design in the interdimensional set...
research
11/20/2021

Mechanism Design with Moral Bidders

A rapidly growing literature on lying in behavioral economics and psycho...
research
04/12/2021

Automated Mechanism Design for Classification with Partial Verification

We study the problem of automated mechanism design with partial verifica...
research
03/03/2019

Revenue Maximization with Imprecise Distribution

We study the revenue maximization problem with an imprecisely estimated ...
research
09/21/2022

Rank-Preserving Multidimensional Mechanisms

We show that the mechanism design problem for a monopolist selling multi...

Please sign up or login with your details

Forgot password? Click here to reset