A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Limitations of VCG-based mechanisms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
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
Computation and incentives in combinatorial public projects
Proceedings of the 11th ACM conference on Electronic commerce
Inapproximability for VCG-based combinatorial auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A truthful randomized mechanism for combinatorial public projects via convex optimization
Proceedings of the 12th ACM conference on Electronic commerce
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
Limitations of Randomized Mechanisms for Combinatorial Auctions
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
The computational complexity of truthfulness in combinatorial auctions
Proceedings of the 13th ACM Conference on Electronic Commerce
Efficient submodular function maximization under linear packing constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational complexity inapproximability results, where the submodular function is given explicitly (under the assumption that NP ≠ RP). Applications of our technique include an optimal computational hardness of (1/2 + ε)-approximation for maximizing a symmetric nonnegative submodular function, an optimal hardness of (1-(1-1/k)k + ε)-approximation for welfare maximization in combinatorial auctions with k submodular bidders (for constant k), super-constant hardness for maximizing a nonnegative submodular function over matroid bases, and tighter bounds for maximizing a monotone submodular function subject to a cardinality constraint. Unlike the vast majority of computational inapproximability results, our approach does not use the PCP machinery or the Unique Games Conjecture, but relies instead on a direct reduction from Unique-SAT using list-decodable codes.