暂无分享,去创建一个
S. Matthew Weinberg | Joan Bruna | Samy Jelassi | Jad Rahme | S. Weinberg | Joan Bruna | Samy Jelassi | Jad Rahme
[1] Chenghao Guo,et al. Settling the sample complexity of single-parameter revenue maximization , 2019, STOC.
[2] Xi Chen,et al. The Complexity of Optimal Multidimensional Pricing , 2013, SODA.
[3] Max Welling,et al. Spherical CNNs , 2018, ICLR.
[4] S. Matthew Weinberg,et al. Symmetries and optimal multi-dimensional mechanism design , 2012, EC '12.
[5] S. Weinberg,et al. Approximation Schemes for a Buyer with Independent Items via Symmetries , 2019, ArXiv.
[6] Barnabás Póczos,et al. Equivariance Through Parameter-Sharing , 2017, ICML.
[7] S. Hart,et al. Maximal revenue with multiple goods: Nonmonotonicity and other observations , 2015 .
[8] Tuomas Sandholm,et al. Automated Design of Revenue-Maximizing Combinatorial Auctions , 2015, Oper. Res..
[9] Stewart W. Wilson. Knowledge Growth in an Artificial Animal , 1985, ICGA.
[10] Alejandro M. Manelli,et al. Bundling as an optimal selling mechanism for a multiple-good monopolist , 2006, J. Econ. Theory.
[11] Tim Roughgarden,et al. Learning Simple Auctions , 2016, COLT.
[12] Yang Cai,et al. An algorithmic characterization of multi-dimensional mechanisms , 2011, STOC '12.
[13] 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.
[14] David C. Parkes,et al. A General Statistical Framework for Designing Strategy-proof Assignment Mechanisms , 2016, UAI.
[15] Thore Graepel,et al. A Neural Architecture for Designing Truthful and Efficient Auctions , 2019, ArXiv.
[16] Saeed Alaei,et al. Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[17] Andrew Chi-Chih Yao,et al. On revenue maximization for selling multiple independently distributed items , 2013, Proceedings of the National Academy of Sciences.
[18] David Silver,et al. A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning , 2017, NIPS.
[19] Lantao Yu,et al. Multi-Agent Adversarial Inverse Reinforcement Learning , 2019, ICML.
[20] Kevin Leyton-Brown,et al. Deep Models of Interactions Across Sets , 2018, ICML.
[21] Xi Chen,et al. On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer , 2017, SODA.
[22] Shuchi Chawla,et al. Mechanism Design for Subadditive Agents via an Ex Ante Relaxation , 2016, EC.
[23] David C. Parkes,et al. Deep Learning for Multi-Facility Location Mechanism Design , 2018, IJCAI.
[24] Nima Haghpanah,et al. Bayesian optimal auctions via multi- to single-agent reduction , 2012, EC '12.
[25] Max Welling,et al. Semi-Supervised Classification with Graph Convolutional Networks , 2016, ICLR.
[26] S. Matthew Weinberg,et al. Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items , 2018, STOC.
[27] Andrew Chi-Chih Yao,et al. An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications , 2014, SODA.
[28] David C. Parkes,et al. Deep Learning for Revenue-Optimal Auctions with Budgets , 2018, AAMAS.
[29] Daniel R. Vincent,et al. Bayesian and Dominant‐Strategy Implementation in the Independent Private‐Values Model , 2010 .
[30] 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.
[31] Maria-Florina Balcan,et al. Sample Complexity of Automated Mechanism Design , 2016, NIPS.
[32] Yaron Lipman,et al. Invariant and Equivariant Graph Networks , 2018, ICLR.
[33] Pierre Vandergheynst,et al. Geometric Deep Learning: Going beyond Euclidean data , 2016, IEEE Signal Process. Mag..
[34] Noam Nisan,et al. The menu-size complexity of auctions , 2013, EC '13.
[35] Tim Roughgarden,et al. Revenue maximization with a single sample , 2010, EC '10.
[36] Pinyan Lu,et al. Tight Revenue Gaps among Simple Mechanisms , 2018, SODA.
[37] Sébastien Lahaie,et al. A Kernel-Based Iterative Combinatorial Auction , 2011, AAAI.
[38] Yang Yuan,et al. Optimal Auctions vs. Anonymous Pricing , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[39] Tim Roughgarden,et al. Simple versus optimal mechanisms , 2009, SECO.
[40] Pinyan Lu,et al. Tight approximation ratio of anonymous pricing , 2018, STOC.
[41] Lawrence D. Jackel,et al. Backpropagation Applied to Handwritten Zip Code Recognition , 1989, Neural Computation.
[42] Vasilis Syrgkanis. A Sample Complexity Measure with Applications to Learning Optimal Auctions , 2017, NIPS.
[43] Max Welling,et al. Group Equivariant Convolutional Networks , 2016, ICML.
[44] S. Matthew Weinberg,et al. Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity , 2018, ACM Trans. Economics and Comput..
[45] Mehryar Mohri,et al. Learning Theory and Algorithms for revenue optimization in second price auctions with reserve , 2013, ICML.
[46] Max Welling,et al. 3D Steerable CNNs: Learning Rotationally Equivariant Features in Volumetric Data , 2018, NeurIPS.
[47] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.
[48] Yang Cai,et al. Simple mechanisms for subadditive buyers via duality , 2016, STOC.
[49] John Thanassoulis,et al. Haggling over substitutes , 2004, J. Econ. Theory.
[50] G. Pavlov,et al. Optimal Mechanism for Selling Two Goods , 2011 .
[51] Christos Tzamos,et al. The Complexity of Optimal Mechanism Design , 2012, SODA.
[52] Qi Qi,et al. On the Approximability of Simple Mechanisms for MHR Distributions , 2019, WINE.
[53] Jimmy Ba,et al. Adam: A Method for Stochastic Optimization , 2014, ICLR.
[54] Yoshua Bengio,et al. Generative Adversarial Nets , 2014, NIPS.
[55] Ah Chung Tsoi,et al. The Graph Neural Network Model , 2009, IEEE Transactions on Neural Networks.
[56] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[57] Christos Tzamos,et al. Strong Duality for a Multiple-Good Monopolist , 2014, EC.
[58] Pingzhong Tang,et al. Optimal mechanisms with simple menus , 2014, EC.
[59] Nikhil R. Devanur,et al. A duality based unified approach to Bayesian mechanism design , 2016, STOC.
[60] 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.
[61] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[62] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[63] Nikhil R. Devanur,et al. The sample complexity of auctions with side information , 2015, STOC.
[64] S. Matthew Weinberg,et al. The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[65] Alexander J. Smola,et al. Deep Sets , 2017, 1703.06114.
[66] Noam Nisan,et al. Sampling and Representation Complexity of Revenue Maximization , 2014, WINE.
[67] Tim Roughgarden,et al. Making the Most of Your Samples , 2014, EC.
[68] Nima Haghpanah,et al. The Simple Economics of Approximately Optimal Auctions , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[69] Yannai A. Gonczarowski,et al. Efficient empirical revenue maximization in single-parameter auction environments , 2016, STOC.
[70] Tim Roughgarden,et al. On the Pseudo-Dimension of Nearly Optimal Auctions , 2015, NIPS.
[71] Paul Dütting,et al. Payment Rules through Discriminant-Based Classifiers , 2012, ACM Trans. Economics and Comput..
[72] Tim Roughgarden,et al. Ironing in the Dark , 2015, EC.
[73] Jason D. Hartline,et al. Sample Complexity for Non-Truthful Mechanisms , 2016, EC.