Better mechanisms for combinatorial auctions via maximal-in-range algorithms?

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)

Computationally feasible VCG mechanisms

Proceedings of the 2nd ACM conference on Electronic commerce

Approximation algorithms for combinatorial auctions with complement-free bidders

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Truthful and Near-Optimal Mechanism Design via Linear Programming

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Truthful randomized mechanisms for combinatorial auctions

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Limitations of VCG-based mechanisms

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Mechanisms for multi-unit auctions

Proceedings of the 8th ACM conference on Electronic commerce

Two Randomized Mechanisms for Combinatorial Auctions

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques