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

Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg. Separating the communication complexity of truthful and non-truthful combinatorial auctions. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath 0001, Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. pages 1073-1085, ACM, 2020. [doi]

Abstract

Abstract is missing.