暂无分享,去创建一个
S. Matthew Weinberg | Mark Braverman | Jieming Mao | S. Weinberg | M. Braverman | Jieming Mao | Mao Braverman | Weinberg December
[1] Jan Vondrák,et al. Limitations of Randomized Mechanisms for Combinatorial Auctions , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[2] E. H. Clarke. Multipart pricing of public goods , 1971 .
[3] Éva Tardos,et al. Bayesian sequential auctions , 2012, EC '12.
[4] Michal Feldman,et al. Simple Mechanisms for Agents with Complements , 2016, EC.
[5] Clifford Stein,et al. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .
[6] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[7] Theodore Groves,et al. Incentives in Teams , 1973 .
[8] U. Feige,et al. The allocation problem with submodular utility functions (preliminary version) , 2006 .
[9] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[10] Shahar Dobzinski,et al. An improved approximation algorithm for combinatorial auctions with submodular bidders , 2006, SODA '06.
[11] Tim Roughgarden,et al. Welfare guarantees for combinatorial auctions with item bidding , 2011, SODA '11.
[12] Uriel Feige,et al. On maximizing welfare when utility functions are subadditive , 2006, STOC '06.
[13] Robert D. Kleinberg,et al. Bayesian incentive compatibility via matchings , 2011, SODA '11.
[14] Éva Tardos,et al. Composable and efficient mechanisms , 2012, STOC '13.
[15] Michal Feldman,et al. Combinatorial Auctions via Posted Prices , 2014, SODA.
[16] Zvi Galil,et al. Lower bounds on communication complexity , 1984, STOC '84.
[17] Noam Nisan,et al. Economic efficiency requires interaction , 2013, STOC.
[18] Shuchi Chawla,et al. Bayesian algorithmic mechanism design , 2014, SECO.
[19] Shahar Dobzinski,et al. The computational complexity of truthfulness in combinatorial auctions , 2012, EC '12.
[20] David Buchfuhrer,et al. Computation and incentives in combinatorial public projects , 2010, EC '10.
[21] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..
[22] Annamária Kovács,et al. Bayesian Combinatorial Auctions , 2008, ICALP.
[23] Michal Feldman,et al. Simultaneous auctions are (almost) efficient , 2012, STOC '13.
[24] Renato Paes Leme,et al. Sequential auctions and externalities , 2011, SODA.
[25] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[26] Gal Shahaf,et al. Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension , 2014, STOC.
[27] Yang Cai,et al. Simultaneous bayesian auctions and computational complexity , 2014, EC.
[28] Shahar Dobzinski,et al. Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders , 2016, STOC.
[29] Vahab S. Mirrokni,et al. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , 2008, EC '08.
[30] Shahar Dobzinski,et al. Computational Efficiency Requires Simple Taxation , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[31] Tim Roughgarden,et al. Sketching valuation functions , 2012, SODA.
[32] Chaitanya Swamy,et al. Truthful and near-optimal mechanism design via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[33] Xiaohui Bei,et al. Bayesian incentive compatibility via fractional assignments , 2010, SODA '11.
[34] A. Razborov. Communication Complexity , 2011 .
[35] Shahar Dobzinski,et al. Two Randomized Mechanisms for Combinatorial Auctions , 2007, APPROX-RANDOM.
[36] Noam Nisan,et al. Truthful randomized mechanisms for combinatorial auctions , 2012, J. Comput. Syst. Sci..
[37] Christos H. Papadimitriou,et al. On the Hardness of Being Truthful , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[38] Satyanarayana V. Lokam,et al. Communication Complexity of Simultaneous Messages , 2003, SIAM J. Comput..
[39] Shahar Dobzinski,et al. On the Complexity of Computing an Equilibrium in Combinatorial Auctions , 2014, SODA.
[40] Shahar Dobzinski,et al. From query complexity to computational complexity , 2012, STOC '12.
[41] Tim Roughgarden,et al. From convex optimization to randomized mechanisms: toward optimal combinatorial auctions , 2011, STOC '11.
[42] Berthold Vöcking,et al. Approximation techniques for utilitarian mechanism design , 2005, STOC '05.
[43] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[44] Berthold Vöcking,et al. Online Mechanism Design (Randomized Rounding on the Fly) , 2012, ICALP.
[45] Thomas M. Cover,et al. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .
[46] S. Matthew Weinberg,et al. Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions , 2015, SODA.
[47] Noga Alon,et al. Welfare Maximization with Limited Interaction , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[48] Nikhil R. Devanur,et al. Simple Auctions with Simple Strategies , 2015, EC.
[49] Elchanan Mossel,et al. Inapproximability for VCG-based combinatorial auctions , 2010, SODA '10.
[50] Sepehr Assadi. Combinatorial Auctions Do Need Modest Interaction , 2017, EC.
[51] Noam Nisan,et al. Rounds in communication complexity revisited , 1991, STOC '91.
[52] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.
[53] John G. van Bosse,et al. Wiley Series in Telecommunications and Signal Processing , 2006 .