2 papers
cs.GT2020
Separating the Communication Complexity of Truthful and Non-Truthful Combinatorial Auctions
Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena +1
We provide the first separation in the approximation guarantee achievable by truthful and non-truthful combinatorial auctions with polynomial communication. Specifically, we prove…
cs.GT2017
The menu complexity of "one-and-a-half-dimensional" mechanism design
Raghuvansh R. Saxena, Ariel Schvartzman, S. Matthew Weinberg
We study the menu complexity of optimal and approximately-optimal auctions in the context of the "FedEx" problem, a so-called "one-and-a-half-dimensional" setting where a single bi…