DeepAI
Log In Sign Up

Separating the Communication Complexity of Truthful and Non-Truthful Combinatorial Auctions

11/14/2020
by   Sepehr Assadi, et al.
0

We provide the first separation in the approximation guarantee achievable by truthful and non-truthful combinatorial auctions with polynomial communication. Specifically, we prove that any truthful mechanism guaranteeing a (3/4-1/240+ε)-approximation for two buyers with XOS valuations over m items requires exp(Ω(ε^2 · m)) communication, whereas a non-truthful algorithm by Dobzinski and Schapira [SODA 2006] and Feige [2009] is already known to achieve a 3/4-approximation in poly(m) communication. We obtain our separation by proving that any simultaneous protocol (not necessarily truthful) which guarantees a (3/4-1/240+ε)-approximation requires communication exp(Ω(ε^2 · m)). The taxation complexity framework of Dobzinski [FOCS 2016] extends this lower bound to all truthful mechanisms (including interactive truthful mechanisms).

READ FULL TEXT

page 1

page 2

page 3

page 4

11/24/2018

Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions

We study the communication complexity of welfare maximization in combina...
06/01/2022

On the Hardness of Dominant Strategy Mechanism Design

We study the communication complexity of dominant strategy implementatio...
10/10/2019

Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms when Demand Queries are NP-hard

State-of-the-art posted-price mechanisms for submodular bidders with m i...
09/19/2021

Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity

We use results from communication complexity, both new and old ones, to ...
11/05/2019

Limitations of the Hyperplane Separation Technique for Bounding the Extension Complexity of Polytopes

This note illustrates the limitations of the hyperplane separation bound...
05/11/2021

Improved Approximate Rips Filtrations with Shifted Integer Lattices and Cubical Complexes

Rips complexes are important structures for analyzing topological featur...
11/11/2021

MaTIC: a Mathematical Theory of Inferential Communication

The arrival of Immersive Virtual and Augmented Reality hardware to the c...