2000 character limit reached
Truthfulness via Proxies (1011.3232v2)
Published 14 Nov 2010 in cs.GT
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.