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…