Truthful and Near-Optimal Mechanism Design via Linear Programming

We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any -approximation algorithm that also bounds the integrality gap ...