Inapproximability of Combinatorial Public Projects
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Characterizing truthful multi-armed bandit mechanisms: extended abstract
Proceedings of the 10th ACM conference on Electronic commerce
The price of truthfulness for pay-per-click auctions
Proceedings of the 10th ACM conference on Electronic commerce
Algorithmic Game Theory: A Snapshot
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A Modular Approach to Roberts' Theorem
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Communications of the ACM
Bayesian algorithmic mechanism design
Proceedings of the forty-second ACM symposium on Theory of computing
Computation and incentives in combinatorial public projects
Proceedings of the 11th ACM conference on Electronic commerce
ACM SIGACT News
Inapproximability for VCG-based combinatorial auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Price of anarchy for greedy auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Differentially private combinatorial optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the limitations of Greedy mechanism design for truthful combinatorial auctions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Single-parameter combinatorial auctions with partially public valuations
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Multi-unit auctions: beyond roberts
Proceedings of the 12th ACM conference on Electronic commerce
A truthful randomized mechanism for combinatorial public projects via convex optimization
Proceedings of the 12th ACM conference on Electronic commerce
On optimal single-item auctions
Proceedings of the forty-third annual ACM symposium on Theory of computing
An impossibility result for truthful combinatorial auctions with submodular valuations
Proceedings of the forty-third annual ACM symposium on Theory of computing
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions
Proceedings of the forty-third annual ACM symposium on Theory of computing
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
Truthful Approximation Schemes for Single-Parameter Agents
SIAM Journal on Computing
On the approximability of budget feasible mechanisms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bayesian incentive compatibility via fractional assignments
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Extending characterizations of truthful mechanisms from subdomains to domains
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
On the limits of black-box reductions in mechanism design
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
From query complexity to computational complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The computational complexity of truthfulness in combinatorial auctions
Proceedings of the 13th ACM Conference on Electronic Commerce
Secondary spectrum auctions for symmetric and submodular bidders
Proceedings of the 13th ACM Conference on Electronic Commerce
The new faces of combinatorial optimization
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
On budget-balanced group-strategyproof cost-sharing mechanisms
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Combinatorial walrasian equilibrium
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.02 |
The central problem in computational mechanism design is the tension between incentive compatibility and computational efficiency. We establish the first significant approximability gap between algorithms that are both truthful and computationally-efficient, and algorithms that only achieve one of these two desiderata. This is shown in the context of a novel mechanism design problem which we call the combinatorial public project problem (cppp). cpppis an abstraction of many common mechanism design situations, ranging from elections of kibbutz committees to network design.Our result is actually made up of two complementary results -- one in the communication-complexity model and one in the computational-complexity model. Both these hardness results heavily rely on a combinatorial characterization of truthful algorithms for our problem. Our computational-complexity result is one of the first impossibility results connecting mechanism design to complexity theory; its novel proof technique involves an application of the Sauer-Shelah Lemma and may be of wider applicability, both within and without mechanism design.