Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding

We design the first truthful-in-expectation, constant-factor approximation mechanisms for NP-hard cases of the welfare maximization problem in combinatorial auctions with nonidentical items and in ...