暂无分享,去创建一个
[1] Annamária Kovács,et al. Bayesian Combinatorial Auctions , 2008, ICALP.
[2] Jan Vondrák,et al. Limitations of Randomized Mechanisms for Combinatorial Auctions , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[3] Faruk Gul,et al. WALRASIAN EQUILIBRIUM WITH GROSS SUBSTITUTES , 1999 .
[4] Michal Feldman,et al. Simultaneous auctions are (almost) efficient , 2012, STOC '13.
[5] E. Glen Weyl,et al. Walrasian Equilibrium in Large, Quasilinear Markets , 2012 .
[6] Xiaohui Bei,et al. Bayesian incentive compatibility via fractional assignments , 2010, SODA '11.
[7] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[8] S. Matthew Weinberg,et al. Matroid prophet inequalities , 2012, STOC '12.
[9] Tim Roughgarden,et al. Revenue maximization with a single sample , 2010, EC '10.
[10] Tim Roughgarden,et al. Simultaneous Single-Item Auctions , 2012, WINE.
[11] Noam Nisan,et al. On the Computational Power of Demand Queries , 2009, SIAM J. Comput..
[12] Tim Roughgarden,et al. Combinatorial auctions with restricted complements , 2012, EC '12.
[13] Shuchi Chawla,et al. Algorithmic pricing via virtual valuations , 2007, EC '07.
[14] Robert D. Kleinberg,et al. Bayesian incentive compatibility via matchings , 2011, SODA '11.
[15] V. Crawford,et al. Job Matching, Coalition Formation, and Gross Substitutes , 1982 .
[16] Michel Gendreau,et al. Combinatorial auctions , 2007, Ann. Oper. Res..
[17] Brendan Lucier,et al. Bayesian algorithmic mechanism design , 2010, BQGT.
[18] Haim Kaplan,et al. Non-price equilibria in markets of discrete goods , 2011, EC '11.
[19] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.
[20] Shahar Dobzinski,et al. Two Randomized Mechanisms for Combinatorial Auctions , 2007, APPROX-RANDOM.
[21] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[22] Moshe Babaioff,et al. Posting Prices with Unknown Distributions , 2017, ICS.
[23] Shahar Dobzinski,et al. The computational complexity of truthfulness in combinatorial auctions , 2012, EC '12.
[24] Liad Blumrosen,et al. Posted prices vs. negotiations: an asymptotic analysis , 2008, EC '08.
[25] Tim Roughgarden,et al. Welfare guarantees for combinatorial auctions with item bidding , 2011, SODA '11.
[26] Uriel Feige,et al. On maximizing welfare when utility functions are subadditive , 2006, STOC '06.
[27] Renato Paes Leme,et al. Gross substitutability: An algorithmic survey , 2017, Games Econ. Behav..
[28] Paul R. Milgrom,et al. Auctions and Bidding: A Primer , 1989 .
[29] 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.
[30] Yang Cai,et al. Simultaneous bayesian auctions and computational complexity , 2014, EC.
[31] Shuchi Chawla,et al. The power of randomness in bayesian optimal mechanism design , 2010, EC '10.
[32] Paul Milgrom,et al. Game theory and the spectrum auctions , 1998 .
[33] Nicole Immorlica,et al. A Unifying Hierarchy of Valuations with Complements and Substitutes , 2014, AAAI.
[34] Tim Roughgarden,et al. Simple versus optimal mechanisms , 2009, EC '09.
[35] Hal R. Varian. Search Engine Economics , 2007, Wirtschaftsinformatik.
[36] Michal Feldman,et al. Combinatorial walrasian equilibrium , 2013, STOC '13.
[37] T. Hill,et al. A Survey of Prophet Inequalities in Optimal Stopping Theory , 1992 .