Mechanisms for Combinatorial Auctions and Public Projects

[1]  Elchanan Mossel,et al.  Inapproximability for VCG-based combinatorial auctions , 2010, SODA '10.

[2]  Noam Nisan,et al.  Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders , 2009 .

[3]  Tim Roughgarden,et al.  Revenue maximization with a single sample , 2010, EC '10.

[4]  S. Bikhchandani,et al.  Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation , 2006 .

[5]  Daniel Lehmann,et al.  Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.

[6]  Shahar Dobzinski,et al.  On characterizations of truthful mechanisms for combinatorial auctions and scheduling , 2008, EC '08.

[7]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[8]  Shahar Dobzinski,et al.  On the Power of Randomization in Algorithmic Mechanism Design , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[9]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[10]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[11]  Noam Nisan,et al.  On the computational power of iterative auctions , 2005, EC '05.

[12]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[13]  Uriel Feige,et al.  Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[14]  Shuchi Chawla,et al.  Algorithmic pricing via virtual valuations , 2007, EC '07.

[15]  Shahar Dobzinski,et al.  An improved approximation algorithm for combinatorial auctions with submodular bidders , 2006, SODA '06.

[16]  Uriel Feige.  On Maximizing Welfare When Utility Functions Are Subadditive , 2009, SIAM J. Comput..

[17]  Christos H. Papadimitriou,et al.  On the Hardness of Being Truthful , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Tim Roughgarden,et al.  Simple versus optimal mechanisms , 2009, SECO.

[19]  Noam Nisan,et al.  Limitations of VCG-based mechanisms , 2007, STOC '07.

[20]  David Buchfuhrer,et al.  Computation and incentives in combinatorial public projects , 2010, EC '10.

[21]  Noam Nisan,et al.  Computationally feasible VCG mechanisms , 2000, EC '00.

[22]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[23]  Noam Nisan,et al.  Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[24]  Tim Roughgarden,et al.  Optimal mechanism design and money burning , 2008, STOC.

[25]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[26]  Aranyak Mehta,et al.  Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions , 2005, Algorithmica.

[27]  Noam Nisan,et al.  Bidding and allocation in combinatorial auctions , 2000, EC '00.

[28]  Tim Roughgarden,et al.  From convex optimization to randomized mechanisms: toward optimal combinatorial auctions , 2011, STOC.

[29]  Amin Saberi,et al.  On the hardness of optimal auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[30]  Noam Nisan,et al.  The communication requirements of efficient allocations and supporting prices , 2006, J. Econ. Theory.

[31]  Amir Ronen,et al.  On approximating optimal auctions , 2001, EC '01.

[32]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[33]  Yaron Singer,et al.  Inapproximability of Combinatorial Public Projects , 2008, WINE.

[34]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[35]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[36]  Tim Roughgarden,et al.  Black-Box Randomized Reductions in Algorithmic Mechanism Design , 2010, FOCS.