Estimating Approximate Incentive Compatibility
暂无分享,去创建一个
Maria-Florina Balcan | Tuomas Sandholm | Ellen Vitercik | Maria-Florina Balcan | T. Sandholm | Ellen Vitercik | M. Balcan
[1] Tuomas Sandholm,et al. Approximating Revenue-Maximizing Combinatorial Auctions , 2005, AAAI.
[2] T. Sandholm,et al. Costly valuation computation in auctions , 2001 .
[3] Maria-Florina Balcan,et al. Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[4] Maria-Florina Balcan,et al. Sample Complexity of Automated Mechanism Design , 2016, NIPS.
[5] R. Buck. Partition of Space , 1943 .
[6] Tuomas Sandholm,et al. Automated Design of Revenue-Maximizing Combinatorial Auctions , 2015, Oper. Res..
[7] J. Lamperti. ON CONVERGENCE OF STOCHASTIC PROCESSES , 1962 .
[8] Shuchi Chawla,et al. Mechanism design for data science , 2014, EC.
[9] Yang Cai,et al. Learning Multi-Item Auctions with (or without) Samples , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[10] Mehryar Mohri,et al. Learning Theory and Algorithms for revenue optimization in second price auctions with reserve , 2013, ICML.
[11] Tuomas Sandholm,et al. Issues in Computational Vickrey Auctions , 2000, Int. J. Electron. Commer..
[12] Tuomas Sandholm,et al. Asymmetric Spite in Auctions , 2010, AAAI.
[13] Nikhil R. Devanur,et al. The sample complexity of auctions with side information , 2015, STOC.
[14] Tri-Dung Nguyen,et al. Multi-option descending clock auction , 2016 .
[15] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[16] David C. Parkes,et al. Deep Learning for Multi-Facility Location Mechanism Design , 2018, IJCAI.
[17] Anshul Kothar,et al. Approximately-strategyproof and tractable multi-unit auctions , 2003 .
[18] Edith Elkind,et al. Designing and learning optimal finite support auctions , 2007, SODA '07.
[19] Sergei Vassilvitskii,et al. Revenue Optimization with Approximate Bid Predictions , 2017, NIPS.
[20] 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).
[21] Yannai A. Gonczarowski,et al. Efficient empirical revenue maximization in single-parameter auction environments , 2016, STOC.
[22] Tim Roughgarden,et al. On the Pseudo-Dimension of Nearly Optimal Auctions , 2015, NIPS.
[23] Paul Dütting,et al. Payment Rules through Discriminant-Based Classifiers , 2012, ACM Trans. Economics and Comput..
[24] Tim Roughgarden,et al. Making the Most of Your Samples , 2014, EC.
[25] Éva Tardos,et al. An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.
[26] M. Rothkopf,et al. Why Are Vickrey Auctions Rare? , 1990, Journal of Political Economy.
[27] Eric Budish,et al. Strategy-Proofness in the Large , 2017, The Review of Economic Studies.
[28] Vincent Conitzer,et al. Computational criticisms of the revelation principle , 2004, EC '04.
[29] Paul Dütting,et al. Optimal auctions through deep learning , 2017, ICML.
[30] Tuomas Sandholm,et al. Better with Byzantine: Manipulation-Optimal Mechanisms , 2009, SAGT.
[31] Shuchi Chawla,et al. A/B Testing of Auctions , 2016, EC.
[32] Subhash Suri,et al. Approximately-strategyproof and tractable multi-unit auctions , 2003, EC '03.
[33] Tuomas Sandholm,et al. Methods for Boosting Revenue in Combinatorial Auctions , 2004, AAAI.
[34] T. Sandholm,et al. Preference Elicitation in Combinatorial Auctions (Extended Abstract) , 2001 .
[35] Yoav Shoham,et al. Spiteful Bidding in Sealed-Bid Auctions , 2007, IJCAI.
[36] Nikhil R. Devanur,et al. Online Auctions and Multi-scale Online Learning , 2017, EC.
[37] Anna R. Karlin,et al. A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders , 2016, WINE.
[38] Moshe Babaioff,et al. The menu-size complexity of revenue approximation , 2016, STOC.
[39] Maria-Florina Balcan,et al. A General Theory of Sample Complexity for Multi-Item Profit Maximization , 2017, EC.
[40] Vincent Conitzer,et al. Incremental Mechanism Design , 2007, IJCAI.
[41] Tim Roughgarden,et al. Learning Simple Auctions , 2016, COLT.
[42] Sergei Vassilvitskii,et al. Testing Incentive Compatibility in Display Ad Auctions , 2018, WWW.
[43] Sven Seuken,et al. An axiomatic approach to characterizing and relaxing strategyproofness of one-sided matching mechanisms , 2014, EC.
[44] Yang Cai,et al. A duality-based unified approach to Bayesian mechanism design , 2016, SECO.
[45] Tuomas Sandholm,et al. Mechanism design and deliberative agents , 2005, AAMAS '05.
[46] Noga Alon,et al. Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues , 2017, NIPS.
[47] David C. Parkes,et al. Approximate Strategyproofness , 2012 .
[48] J. Morgan,et al. The Spite Motive and Equilibrium Behavior in Auctions , 2003 .
[49] Tim Roughgarden,et al. Ironing in the Dark , 2015, EC.
[50] Noam Nisan,et al. Approximate revenue maximization with multiple items , 2012, EC '12.
[51] Tuomas Sandholm,et al. Optimal Auctions for Spiteful Bidders , 2012, AAAI.
[52] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[53] Tuomas Sandholm,et al. Automated Mechanism Design: A New Application Area for Search Algorithms , 2003, CP.
[54] L. Hurwicz. On informationally decentralized systems , 1977 .
[55] Tuomas Sandholm,et al. An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.
[56] Vahab S. Mirrokni,et al. Incentive-Aware Learning for Large Markets , 2018, WWW.
[57] David C. Parkes,et al. Deep Learning for Revenue-Optimal Auctions with Budgets , 2018, AAMAS.
[58] Maria-Florina Balcan,et al. Reducing mechanism design to algorithm design via machine learning , 2007, J. Comput. Syst. Sci..
[59] Parag A. Pathak,et al. School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation. NBER Working Paper No. 16783. , 2011 .
[60] Andrew Chi-Chih Yao,et al. An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications , 2014, SODA.
[61] E. Maasland,et al. Auction Theory , 2021, Springer Texts in Business and Economics.
[62] Ariel D. Procaccia,et al. Incentive compatible regression learning , 2008, SODA '08.
[63] Tuomas Sandholm,et al. Preference elicitation in combinatorial auctions , 2002, EC '01.
[64] Peter L. Bartlett,et al. Neural Network Learning - Theoretical Foundations , 1999 .
[65] David C. Parkes,et al. Optimal Auction Design for Agents with Hard Valuation Problems , 1999, Agent Mediated Electronic Commerce.
[66] Shai Ben-David,et al. Understanding Machine Learning: From Theory to Algorithms , 2014 .
[67] T. Sandholm. Very-Large-Scale Generalized Combinatorial Multi-Attribute Auctions: Lessons from Conducting $60 Billion of Sourcing , 2013 .