Do prices coordinate markets?
暂无分享,去创建一个
Justin Hsu | Aaron Roth | Rakesh V. Vohra | Ryan M. Rogers | Jamie Morgenstern | R. Vohra | Aaron Roth | Justin Hsu | Jamie Morgenstern
[1] Peter L. Bartlett,et al. Neural Network Learning - Theoretical Foundations , 1999 .
[2] Noam Nisan,et al. The communication requirements of efficient allocations and supporting prices , 2006, J. Econ. Theory.
[3] Shai Ben-David,et al. Understanding Machine Learning: From Theory to Algorithms , 2014 .
[4] Claudio Gentile,et al. Regret Minimization for Reserve Prices in Second-Price Auctions , 2013, IEEE Transactions on Information Theory.
[5] Tim Roughgarden,et al. Revenue maximization with a single sample , 2015, Games Econ. Behav..
[6] Ennio Stacchetti,et al. The English Auction with Differentiated Commodities , 2000, J. Econ. Theory.
[7] Mehryar Mohri,et al. Learning Theory and Algorithms for revenue optimization in second price auctions with reserve , 2013, ICML.
[8] Kazuo Murota,et al. Convexity and Steinitz's Exchange Property , 1996, IPCO.
[9] Edith Elkind,et al. Designing and learning optimal finite support auctions , 2007, SODA '07.
[10] Mark Braverman,et al. Optimal provision-after-wait in healthcare , 2013, Math. Oper. Res..
[11] Nikhil R. Devanur,et al. Prior-Independent Multi-parameter Mechanism Design , 2011, WINE.
[12] Thomas P. Hayes,et al. The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.
[13] Zaifu Yang,et al. A Note on Kelso and Crawford's Gross Substitutes Condition , 2003, Math. Oper. Res..
[14] Tim Roughgarden,et al. On the Pseudo-Dimension of Nearly Optimal Auctions , 2015, NIPS.
[15] Kazuo Murota,et al. Valuated Matroid Intersection I: Optimality Criteria , 1996, SIAM J. Discret. Math..
[16] Maria-Florina Balcan,et al. Learning Economic Parameters from Revealed Preferences , 2014, WINE.
[17] Faruk Gul,et al. WALRASIAN EQUILIBRIUM WITH GROSS SUBSTITUTES , 1999 .
[18] Steve Hanneke,et al. The Optimal Sample Complexity of PAC Learning , 2015, J. Mach. Learn. Res..
[19] Peter L. Bartlett,et al. Learning in Neural Networks: Theoretical Foundations , 1999 .
[20] Anna R. Karlin,et al. Competitive auctions , 2006, Games Econ. Behav..
[21] V. Crawford,et al. Job Matching, Coalition Formation, and Gross Substitutes , 1982 .
[22] Tim Roughgarden,et al. Simple versus optimal mechanisms , 2009, SECO.
[23] Moshe Babaioff,et al. Posting Prices with Unknown Distributions , 2017, ICS.
[24] D. Pollard. Convergence of stochastic processes , 1984 .
[25] Noam Nisan,et al. Sampling and Representation Complexity of Revenue Maximization , 2014, WINE.
[26] Tim Roughgarden,et al. Making the Most of Your Samples , 2014, EC.
[27] Kazuo Murota,et al. M-Convex Function on Generalized Polymatroid , 1999, Math. Oper. Res..
[28] Manfred K. Warmuth,et al. Relating Data Compression and Learnability , 2003 .
[29] Nikhil R. Devanur,et al. Random Sampling Auctions for Limited Supply , 2007 .
[30] Renato Paes Leme,et al. Gross substitutes and endowed assignment valuations , 2015 .
[31] Tim Roughgarden,et al. Ironing in the Dark , 2015, EC.
[32] HsuJustin,et al. Do prices coordinate markets , 2016 .
[33] Leslie G. Valiant,et al. A general lower bound on the number of examples needed for learning , 1988, COLT '88.
[34] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[35] Maria-Florina Balcan,et al. Mechanism design via machine learning , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[36] Avrim Blum,et al. Near-optimal online auctions , 2005, SODA '05.
[37] K. Arrow,et al. EXISTENCE OF AN EQUILIBRIUM FOR A COMPETITIVE ECONOMY , 1954 .
[38] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[39] Zizhuo Wang,et al. A Dynamic Near-Optimal Algorithm for Online Linear Programming , 2009, Oper. Res..
[40] Amit Daniely,et al. Optimal learners for multiclass problems , 2014, COLT.
[41] V. Vapnik. Estimation of Dependences Based on Empirical Data , 2006 .
[42] S. Reiter,et al. The informational size of message spaces , 1974 .
[43] R. Ravi,et al. The Geometry of Online Packing Linear Programs , 2012, Math. Oper. Res..
[44] Xiaotie Deng,et al. On the complexity of equilibria , 2002, STOC '02.
[45] A. Tamura,et al. GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY , 2015 .
[46] Maria-Florina Balcan,et al. Reducing mechanism design to algorithm design via machine learning , 2007, J. Comput. Syst. Sci..
[47] Ilan Newman,et al. Ascending auctions and Walrasian equilibrium , 2013, ArXiv.
[48] Vijay Kumar,et al. Online learning in online auctions , 2003, SODA '03.
[49] J. Oxley. Matroid Theory (Oxford Graduate Texts in Mathematics) , 2006 .
[50] Itai Ashlagi,et al. Ascending Unit Demand Auctions with Budget Limits , 2009 .