Automated Mechanism Design via Neural Networks

Using AI approaches to automatically design mechanisms has been a central research mission at the interface of AI and economics. Previous approaches that attempt to design revenue optimal auctions for the multi-dimensional settings fall short in at least one of the three aspects: 1) representation --- search in a space that probably does not even contain the optimal mechanism; 2) exactness --- finding a mechanism that is either not truthful or far from optimal; 3) domain dependence --- need a different design for different environment settings. To resolve the three difficulties, in this paper, we put forward a unified neural network based framework that automatically learns to design revenue optimal mechanisms. Our framework consists of a mechanism network that takes an input distribution for training and outputs a mechanism, as well as a buyer network that takes a mechanism as input and output an action. Such a separation in design mitigates the difficulty to impose incentive compatibility constraints on the mechanism, by making it a rational choice of the buyer. As a result, our framework easily overcomes the previously mentioned difficulty in incorporating IC constraints and always returns exactly incentive compatible mechanisms. We then applied our framework to a number of multi-item auction design settings, for a few of which the theoretically optimal mechanisms are unknown. We then go on to theoretically prove that the mechanisms found by our framework are indeed optimal.

[1]  Vincent Conitzer,et al.  Complexity of Mechanism Design , 2002, UAI.

[2]  David C. Parkes,et al.  Deep Learning for Multi-Facility Location Mechanism Design , 2018, IJCAI.

[3]  Yoshua Bengio,et al.  Generative Adversarial Nets , 2014, NIPS.

[4]  Anton Likhodedov,et al.  Automated Design of Revenue-Maximizing Combinatorial , 2015 .

[5]  David C. Parkes,et al.  Deep Learning for Revenue-Optimal Auctions with Budgets , 2018, AAMAS.

[6]  Tim Roughgarden,et al.  Simple versus optimal mechanisms , 2009, EC '09.

[7]  Y. Narahari,et al.  On Optimal Mechanisms in the Two-Item Single-Buyer Unit-Demand Setting , 2017, Journal of Mathematical Economics.

[8]  M. Armstrong Multiproduct Nonlinear Pricing , 1996 .

[9]  Yvonne Schuhmacher,et al.  Mechanism Design A Linear Programming Approach , 2016 .

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

[11]  Renato Paes Leme,et al.  Dynamic Mechanism Design in the Field , 2017, WWW.

[12]  R. Selten,et al.  Bounded rationality: The adaptive toolbox , 2000 .

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

[14]  Pingzhong Tang,et al.  Optimal Auctions for Partially Rational Bidders , 2015, IJCAI.

[15]  Renato Paes Leme,et al.  Optimal Dynamic Auctions Are Virtual Welfare Maximizers , 2018, AAAI.

[16]  Renato Paes Leme,et al.  Non-clairvoyant Dynamic Mechanism Design , 2018, EC.

[17]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[18]  Noam Nisan,et al.  Approximate revenue maximization with multiple items , 2012, EC '12.

[19]  Renato Paes Leme,et al.  Optimal dynamic mechanisms with ex-post IR via bank accounts , 2016, ArXiv.

[20]  Christos Tzamos,et al.  Mechanism design via optimal transport , 2013, EC.

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

[22]  Tuomas Sandholm,et al.  Optimal Auctions for Spiteful Bidders , 2012, AAAI.

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

[24]  Tuomas Sandholm,et al.  Mixed-bundling auctions with reserve prices , 2012, AAMAS.

[25]  Yiwei Zhang,et al.  Reinforcement Mechanism Design for Fraudulent Behaviour in e-Commerce , 2018, AAAI.

[26]  G. Pavlov,et al.  Optimal Mechanism for Selling Two Goods , 2011 .

[27]  Zihe Wang,et al.  Ex-post IR Dynamic Auctions with Cost-per-Action Payments , 2018, IJCAI.

[28]  Andrew Chi-Chih Yao,et al.  Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison , 2017, EC.

[29]  G. Pavlov,et al.  A Property of Solutions to Linear Monopoly Problems , 2011 .

[30]  Pingzhong Tang,et al.  Optimal mechanisms with simple menus , 2017 .

[31]  Y. Narahari,et al.  Optimal Mechanism for Selling Two Items to a Single Buyer Having Uniformly Distributed Valuations , 2016, WINE.

[32]  Pingzhong Tang,et al.  Optimal Auctions for Negatively Correlated Items , 2016, EC.

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

[34]  A. Rubinstein Modeling Bounded Rationality , 1998 .

[35]  Pingzhong Tang,et al.  Reinforcement mechanism design , 2017, IJCAI.

[36]  Alejandro M. Manelli,et al.  Multidimensional Mechanism Design: Revenue Maximization and the Multiple-Good Monopoly , 2004, J. Econ. Theory.

[37]  Renato Paes Leme,et al.  Dynamic Mechanisms with Martingale Utilities , 2017, EC.

[38]  Yan Hong,et al.  Reinforcement Mechanism Design, with Applications to Dynamic Pricing in Sponsored Search Auctions , 2017, ArXiv.

[39]  Constantinos Daskalakis,et al.  Multi-item auctions defying intuition? , 2015, SECO.

[40]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[41]  Nima Haghpanah,et al.  Multi-dimensional Virtual Values and Second-degree Price Discrimination , 2014 .

[42]  Yiwei Zhang,et al.  Reinforcement Mechanism Design for e-commerce , 2017, WWW.

[43]  Renato Paes Leme,et al.  Dynamic Revenue Sharing , 2017, NIPS.

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

[45]  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.

[46]  Paul Dütting,et al.  Optimal auctions through deep learning , 2017, ICML.

[47]  Renato Paes Leme,et al.  Dynamic Auctions with Bank Accounts , 2016, IJCAI.

[48]  Gabriel D. Carroll Robustness and Separation in Multidimensional Screening , 2017 .

[49]  Renato Paes Leme,et al.  Dynamic Double Auctions: Toward First Best , 2019, SODA.