Truthfulness via Proxies
classification
💻 cs.GT
keywords
approximationauctionsbidderscombinatorialcommunicationexhibitsfracmechanism
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.