Sample Complexity of Automated Mechanism Design
暂无分享,去创建一个
Maria-Florina Balcan | Tuomas Sandholm | Ellen Vitercik | Maria-Florina Balcan | T. Sandholm | Ellen Vitercik | M. Balcan
[1] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[2] E. H. Clarke. Multipart pricing of public goods , 1971 .
[3] Theodore Groves,et al. Incentives in Teams , 1973 .
[4] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[5] F. Hahn,et al. Optimal Multi-Unit Auctions , 1989 .
[6] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[7] Peter L. Bartlett,et al. Neural Network Learning - Theoretical Foundations , 1999 .
[8] C. Avery,et al. Bundling and Optimal Auctions of Multiple Products , 2000 .
[9] Michael P. Wellman,et al. AkBA: a progressive, anonymous-price combinatorial auction , 2000, EC '00.
[10] David C. Parkes,et al. Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.
[11] M. Armstrong. Optimal Multi-Object Auctions , 2000 .
[12] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[13] T. Sandholm,et al. Applications of Automated Mechanism Design , 2003 .
[14] Noam Nisan,et al. Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[15] Tuomas Sandholm,et al. Automated Mechanism Design: A New Application Area for Search Algorithms , 2003, CP.
[16] Tuomas Sandholm,et al. Methods for Boosting Revenue in Combinatorial Auctions , 2004, AAAI.
[17] Vincent Conitzer,et al. Self-interested automated mechanism design and implications for optimal combinatorial auctions , 2004, EC '04.
[18] David C. Parkes,et al. Approximately Efficient Online Mechanism Design , 2004, NIPS.
[19] Yoav Shoham,et al. Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.
[20] Tuomas Sandholm,et al. Approximating Revenue-Maximizing Combinatorial Auctions , 2005, AAAI.
[21] Edith Elkind,et al. Designing and learning optimal finite support auctions , 2007, SODA '07.
[22] Michel Gendreau,et al. Combinatorial auctions , 2007, Ann. Oper. Res..
[23] Philippe Jehiel,et al. Mixed Bundling Auctions , 2006, J. Econ. Theory.
[24] Maria-Florina Balcan,et al. Reducing mechanism design to algorithm design via machine learning , 2007, J. Comput. Syst. Sci..
[25] Tim Roughgarden,et al. Simple versus optimal mechanisms , 2009, SECO.
[26] Gagan Goel,et al. Budget constrained auctions with heterogeneous items , 2009, STOC '10.
[27] Sébastien Lahaie,et al. A Kernel-Based Iterative Combinatorial Auction , 2011, AAAI.
[28] Tuomas Sandholm,et al. Mixed-bundling auctions with reserve prices , 2012, AAMAS.
[29] Yang Cai,et al. An algorithmic characterization of multi-dimensional mechanisms , 2011, STOC '12.
[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] S. Matthew Weinberg,et al. Matroid prophet inequalities , 2012, STOC '12.
[32] Ameet Talwalkar,et al. Foundations of Machine Learning , 2012, Adaptive computation and machine learning.
[33] Nima Haghpanah,et al. The Simple Economics of Approximately Optimal Auctions , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[34] Umar Syed,et al. Learning Prices for Repeated Auctions with Strategic Buyers , 2013, NIPS.
[35] Kamesh Munagala,et al. Optimal auctions via the multiplicative weight method , 2012, EC '13.
[36] Yang Cai,et al. Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations , 2013, SODA.
[37] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[38] Noam Nisan,et al. Sampling and Representation Complexity of Revenue Maximization , 2014, WINE.
[39] Mehryar Mohri,et al. Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers , 2014, NIPS.
[40] Christos Tzamos,et al. The Complexity of Optimal Mechanism Design , 2012, SODA.
[41] Shai Ben-David,et al. Understanding Machine Learning: From Theory to Algorithms , 2014 .
[42] Mehryar Mohri,et al. Learning Theory and Algorithms for revenue optimization in second price auctions with reserve , 2013, ICML.
[43] Tim Roughgarden,et al. On the Pseudo-Dimension of Nearly Optimal Auctions , 2015, NIPS.
[44] Tuomas Sandholm,et al. Automated Design of Revenue-Maximizing Combinatorial Auctions , 2015, Oper. Res..
[45] Mehryar Mohri,et al. Revenue Optimization against Strategic Buyers , 2015, NIPS.
[46] Michal Feldman,et al. Combinatorial Auctions via Posted Prices , 2014, SODA.
[47] Tim Roughgarden,et al. Making the Most of Your Samples , 2014, EC.
[48] Mehryar Mohri,et al. Learning with Deep Cascades , 2015, ALT.
[49] Tim Roughgarden,et al. Learning Simple Auctions , 2016, COLT.
[50] Tim Roughgarden,et al. Ironing in the Dark , 2015, EC.
[51] Nikhil R. Devanur,et al. The sample complexity of auctions with side information , 2015, STOC.
[52] Justin Hsu,et al. Do prices coordinate markets? , 2015, SECO.