Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Truthful and Near-Optimal Mechanism Design via Linear Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On maximizing welfare when utility functions are subadditive
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Truthful randomized mechanisms for combinatorial auctions
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Optimal mechanism design and money burning
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
On the Hardness of Being Truthful
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Bayesian algorithmic mechanism design
Proceedings of the forty-second ACM symposium on Theory of computing
Multi-parameter mechanism design and sequential posted pricing
Proceedings of the forty-second ACM symposium on Theory of computing
Budget constrained auctions with heterogeneous items
Proceedings of the forty-second ACM symposium on Theory of computing
Black-Box Randomized Reductions in Algorithmic Mechanism Design
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Bayesian incentive compatibility via matchings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Black-box reductions in mechanism design
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the limits of black-box reductions in mechanism design
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Budget feasible mechanism design: from prior-free to bayesian
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
An algorithmic characterization of multi-dimensional mechanisms
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Cost-recovering bayesian algorithmic mechanism design
Proceedings of the fourteenth ACM conference on Electronic commerce
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
Theory of Computing Systems
Hi-index | 0.00 |
Very recently, Hartline and Lucier [14] studied single-parameter mechanism design problems in the Bayesian setting. They proposed a black-box reduction that converted Bayesian approximation algorithms into Bayesian-Incentive-Compatible (BIC) mechanisms while preserving social welfare. It remains a major open question if one can find similar reduction in the more important multi-parameter setting. In this paper, we give positive answer to this question when the prior distribution has finite and small support. We propose a black-box reduction for designing BIC multi-parameter mechanisms. The reduction converts any algorithm into an ε-BIC mechanism with only marginal loss in social welfare. As a result, for combinatorial auctions with sub-additive agents we get an ε-BIC mechanism that achieves constant approximation.