Optimal Communication-Efficient Truthful Mechanisms for Combinatorial Auctions

The authors settle the communication complexity necessary to achieve any approximation guarantee via maximal-in-range (VCG-based) mechanisms for combinatorial auctions, providing tight bounds for both submodular and general valuations.