Truthfulness via Proxies

Abstract

This short note exhibits a truthful-in-expectation $O(\frac{\log m}{\log \log m})$-approximation mechanism for combinatorial auctions with subadditive bidders that uses polynomial communication.

References in corpus (1)

• On the Power of Randomization in Algorithmic Mechanism Design

Cited by in corpus (3)

• Mechanisms for Risk Averse Agents, Without Loss
• Combinatorial Auctions with Restricted Complements
• A Note on Relaxation and Rounding in Algorithmic Mechanism Design