暂无分享,去创建一个
[1] Maria-Florina Balcan,et al. Sample Complexity of Automated Mechanism Design , 2016, NIPS.
[2] Xiaohui Bei,et al. Bayesian incentive compatibility via fractional assignments , 2010, SODA '11.
[3] Yang Cai,et al. An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization , 2021, SODA.
[4] Xi Chen,et al. On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer , 2018, SODA.
[5] S. Matthew Weinberg,et al. Symmetries and optimal multi-dimensional mechanism design , 2012, EC '12.
[6] Christos Tzamos,et al. Strong Duality for a Multiple-Good Monopolist , 2014, EC.
[7] Noam Nisan,et al. Sampling and Representation Complexity of Revenue Maximization , 2014, WINE.
[8] Shaddin Dughmi,et al. Bernoulli factories and black-box reductions in mechanism design , 2017, SECO.
[9] David C. Parkes,et al. Deep Learning for Multi-Facility Location Mechanism Design , 2018, IJCAI.
[10] Robert D. Kleinberg,et al. Bayesian incentive compatibility via matchings , 2011, SODA '11.
[11] Sébastien Lahaie,et al. A Kernel-Based Iterative Combinatorial Auction , 2011, AAAI.
[12] Frank Hutter,et al. Decoupled Weight Decay Regularization , 2017, ICLR.
[13] Alejandro M. Manelli,et al. Bundling as an optimal selling mechanism for a multiple-good monopolist , 2006, J. Econ. Theory.
[14] Tim Roughgarden,et al. Learning Simple Auctions , 2016, COLT.
[15] S. Matthew Weinberg,et al. A Permutation-Equivariant Neural Network Architecture For Auction Design , 2020, AAAI.
[16] Maria-Florina Balcan,et al. Mechanism design via machine learning , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[17] Yoshua Bengio,et al. Generative Adversarial Nets , 2014, NIPS.
[18] Chenghao Guo,et al. Settling the sample complexity of single-parameter revenue maximization , 2019, STOC.
[19] Noam Nisan,et al. Approximate revenue maximization with multiple items , 2012, EC '12.
[20] Yang Cai,et al. A duality-based unified approach to Bayesian mechanism design , 2016, SECO.
[21] Xi Chen,et al. The Complexity of Optimal Multidimensional Pricing , 2013, SODA.
[22] Xi Chen,et al. On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[23] Christos Tzamos,et al. The Complexity of Optimal Mechanism Design , 2012, SODA.
[24] Paul Dütting,et al. Optimal auctions through deep learning , 2017, ICML.
[25] Paul Dütting,et al. Payment Rules through Discriminant-Based Classifiers , 2012, ACM Trans. Economics and Comput..
[26] David C. Parkes,et al. Deep Learning for Revenue-Optimal Auctions with Budgets , 2018, AAMAS.
[27] Brendan Lucier,et al. Bayesian algorithmic mechanism design , 2010, BQGT.
[28] Jason D. Hartline,et al. Sample Complexity for Non-Truthful Mechanisms , 2016, EC.
[29] Tim Roughgarden,et al. Making the Most of Your Samples , 2014, EC.
[30] Tim Roughgarden,et al. On the Pseudo-Dimension of Nearly Optimal Auctions , 2015, NIPS.
[31] S. H. Hong. Optimal Auction Design , 2004 .
[32] Tim Roughgarden,et al. Ironing in the Dark , 2015, EC.
[33] Mu-ming Poo,et al. Andrew Chi-Chih Yao: the future of quantum computing , 2018 .