Showing 2017Show all
2 papers · 1 filter
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…
cs.GT2017
On Simultaneous Two-player Combinatorial Auctions
Mark Braverman, Jieming Mao, S. Matthew Weinberg
We consider the following communication problem: Alice and Bob each have some valuation functions and over subsets of items, and their goal is to part…