Separating the communication complexity of truthful and non-truthful combinatorial auctions

DOI10.1145/3357713.3384267MaRDI QIDQ5144993zbMATH OpenOpenAlexFDO

Authors Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg

Publication date 19 January 2021

Published in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.07414

zbMATH Keywords

combinatorial auctionslower boundssimultaneous communication

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Improved truthful mechanisms for combinatorial auctions with submodular bidders

This page was built for publication: Separating the communication complexity of truthful and non-truthful combinatorial auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144993)