Does Information Revelation Improve Revenue?

We study the problem of optimal auction design in a valuation model, explicitly motivated by online ad auctions, in which there is two-way informational asymmetry, in the sense that private information is available to both the seller (the item type) and the bidders (their type), and the value of each bidder for the item depends both on his own and the item's type. Importantly, we allow arbitrary auction formats involving, potentially, several rounds of signaling from the seller and decisions by the bidders, and seek to find the optimum co-design of signaling and auction (we call this optimum the "optimum augmented auction"). We characterize exactly the optimum augmented auction for our valuation model by establishing its equivalence with a multi-item Bayesian auction with additive bidders. Surprisingly, in the optimum augmented auction there is no signaling whatsoever, and in fact the seller need not access the available information about the item type until after the bidder chooses his bid. Suboptimal solutions to this problem, which have appeared in the recent literature, are shown to correspond to well-studied ways to approximate multi-item auctions by simpler formats, such as grand-bundling (this corresponds to Myerson's auction without any information revelation), selling items separately (this corresponds to Myerson's auction preceded by full information revelation as in [Fu et al. 2012]), and fractional partitioning (this corresponds to Myerson's auction preceded by optimal signaling). Consequently, all these solutions are separated by large approximation gaps from the optimum revenue.

[1]  Elias Koutsoupias,et al.  Duality and optimality of auctions for uniform distributions , 2014, SIAM J. Comput..

[2]  Christos Tzamos,et al.  The Complexity of Optimal Mechanism Design , 2012, SODA.

[3]  Nima Haghpanah,et al.  Bayesian optimal auctions via multi- to single-agent reduction , 2012, EC '12.

[4]  Patrick Hummel,et al.  When Does Improved Targeting Increase Revenue? , 2016, ACM Trans. Economics and Comput..

[5]  Yang Cai,et al.  Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[6]  Paul R. Milgrom,et al.  A theory of auctions and competitive bidding , 1982 .

[7]  Moshe Babaioff,et al.  Peaches, lemons, and cookies: designing auction markets with dispersed information , 2013, EC '13.

[8]  Yang Cai,et al.  An algorithmic characterization of multi-dimensional mechanisms , 2011, STOC '12.

[9]  Christos Tzamos,et al.  Strong Duality for a Multiple-Good Monopolist , 2014, EC.

[10]  Noam Nisan,et al.  The menu-size complexity of auctions , 2013, EC '13.

[11]  Yang Cai,et al.  Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations , 2013, SODA.

[12]  Moshe Tennenholtz,et al.  Signaling Schemes for Revenue Maximization , 2012, TEAC.

[13]  Andrew Chi-Chih Yao,et al.  On revenue maximization for selling multiple independently distributed items , 2013, Proceedings of the National Academy of Sciences.

[14]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[15]  S. Matthew Weinberg,et al.  A Simple and Approximately Optimal Mechanism for an Additive Buyer , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[16]  Achim Wambach,et al.  Sequential Information Disclosure in Auctions , 2013, J. Econ. Theory.

[17]  Andrew Chi-Chih Yao,et al.  An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications , 2014, SODA.

[18]  Nima Haghpanah,et al.  The Simple Economics of Approximately Optimal Auctions , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[19]  J. Stiglitz The market for 'lemons': quality uncertainty and the market mechanism , 2002 .

[20]  Christos Tzamos,et al.  Optimal Pricing Is Hard , 2012, WINE.

[21]  Sergei Vassilvitskii,et al.  Value of Targeting , 2014, SAGT.

[22]  Christos Tzamos,et al.  Mechanism design via optimal transport , 2013, EC '13.

[23]  Sergei Vassilvitskii,et al.  Ad auctions with data , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[24]  Péter Eso,et al.  Optimal Information Disclosure in Auctions and the Handicap Auction , 2007 .

[25]  S. Board,et al.  Revealing information in auctions: the allocation effect , 2009 .

[26]  Li Han,et al.  Mixture Selection, Mechanism Design, and Signaling , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[27]  Nima Haghpanah,et al.  Reverse Mechanism Design , 2014, EC.

[28]  Peter Bro Miltersen,et al.  Send mixed signals: earn more, work less , 2012, EC '12.

[29]  Dirk Bergemann,et al.  Information Structures in Optimal Auctions , 2001, J. Econ. Theory.

[30]  Nicole Immorlica,et al.  Constrained Signaling in Auction Design , 2013, SODA.