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 $v_1(\cdot )$ and $v_2(\cdot )$ over subsets of $m$ items, and their goal is to part…