English

Optimal Deterministic Mechanisms for an Additive Buyer

Computer Science and Game Theory 2018-04-20 v1

Abstract

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.

Keywords

Cite

@article{arxiv.1804.06867,
  title  = {Optimal Deterministic Mechanisms for an Additive Buyer},
  author = {Moshe Babaioff and Noam Nisan and Aviad Rubinstein},
  journal= {arXiv preprint arXiv:1804.06867},
  year   = {2018}
}
R2 v1 2026-06-23T01:27:58.165Z