Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders
Authors:
Conference:
This paper makes an (almost) exponential progress on one of the most
longstanding open problems of algorithmic mechanism design literature.
Our follow-up work in [AKS21] further simplifies and generalize it (from submodular to subadditive valuations).
Abstract:
Conference version:
Full version:
Streaming video:
Short research note:
BibTex: