More Revenue from Two Samples via Factor Revealing SDPs
暂无分享,去创建一个
[1] Tim Roughgarden,et al. Ironing in the Dark , 2015, EC.
[2] Moshe Babaioff,et al. Are Two (Samples) Really Better Than One? , 2018, EC.
[3] Nikhil R. Devanur,et al. The sample complexity of auctions with side information , 2015, STOC.
[4] Noam Nisan,et al. Sampling and Representation Complexity of Revenue Maximization , 2014, WINE.
[5] Tim Roughgarden,et al. Making the Most of Your Samples , 2014, EC.
[6] Nicole Immorlica,et al. Randomization Beats Second Price as a Prior-Independent Auction , 2015, EC.
[7] Yang Cai,et al. Extreme-Value Theorems for Optimal Multidimensional Pricing , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[8] Maria-Florina Balcan,et al. A General Theory of Sample Complexity for Multi-Item Profit Maximization , 2017, EC.
[9] Anna R. Karlin,et al. A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders , 2016, WINE.
[10] Yannai A. Gonczarowski,et al. Efficient empirical revenue maximization in single-parameter auction environments , 2016, STOC.
[11] Yang Cai,et al. Learning Multi-Item Auctions with (or without) Samples , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[12] Tim Roughgarden,et al. Revenue maximization with a single sample , 2010, EC '10.
[13] Maria-Florina Balcan,et al. Sample Complexity of Automated Mechanism Design , 2016, NIPS.
[14] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[15] Noga Alon,et al. Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues , 2017, NIPS.
[16] R. Zeckhauser,et al. Optimal Selling Strategies: When to Haggle, When to Hold Firm , 1983 .
[17] Stephen P. Boyd,et al. Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding , 2013, Journal of Optimization Theory and Applications.
[18] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..