Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders

Shahar Dobzinski. Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 940-948, ACM, 2016. [doi]

Abstract

Abstract is missing.