Information Design in Optimal Auctions.

We study the information design problem in a single-unit auction setting. The information designer controls independent private signals according to which the buyers infer their binary private values. Assuming that the seller adopts the optimal auction due to Myerson (1981) in response, we characterize both the buyer-optimal information structure, which maximizes the buyers' surplus, and the sellerworst information structure, which minimizes the seller's revenue. We translate both information design problems into finite-dimensional, constrained optimization problems in which one can explicitly solve for the optimal information structures. In contrast to the case with one buyer (Roesler and Szentes, 2017 and Du, 2018), we show that with two or more buyers, the symmetric buyer-optimal information structure is different from the symmetric seller-worst information structure. The good is always sold under the seller-worst information structure but not under the buyer-optimal information structure. Nevertheless, as the number of buyers goes to infinity, both symmetric information structures converge to no disclosure. We also show that in an ex ante symmetric setting, an asymmetric information structure is never seller-worst but can generate a strictly higher surplus for the buyers than the symmetric buyer-optimal information structure.

[1]  Alex Suzdaltsev Distributionally Robust Pricing in Independent Private Value Auctions , 2020, ArXiv.

[2]  D. Blackwell Equivalent Comparisons of Experiments , 1953 .

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

[4]  S. Brendle,et al.  Calculus of Variations , 1927, Nature.

[5]  Benjamin A. Brooks,et al.  Informationally Robust Optimal Auction Design , 2016 .

[6]  Humberto Moreira,et al.  Optimal selling mechanisms under moment conditions , 2018, J. Econ. Theory.

[7]  Tilman Börgers,et al.  An introduction to the theory of mechanism design , 2015 .

[8]  Piotr Dworczak,et al.  The Simple Economics of Optimal Persuasion , 2017, Journal of Political Economy.

[9]  Benjamin Brooks,et al.  Optimal Auction Design with Common Values: An Informationally-Robust Approach , 2019, Econometrica.

[10]  Stefan Terstiege,et al.  Buyer-Optimal Extensionproof Information , 2019, J. Econ. Theory.

[11]  B. Svaiter,et al.  Optimal auction with a general distribution: Virtual valuation without densities , 2010 .

[12]  Balázs Szentes,et al.  Buyer-Optimal Learning and Monopoly Pricing , 2017 .

[13]  A note on the continuity of the optimal auction , 2015 .

[14]  Keith Edward Bullen An Introduction to the Theory of Mechanics , 1951 .

[15]  Songzi Du,et al.  Robust Mechanisms Under Common Valuation , 2016, ArXiv.

[16]  Kai Hao Yang,et al.  Buyer-Optimal Information with Nonlinear Technology , 2019 .

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