Combinatorial Auctions and Single-Minded Bidders
Here’s an interesting problem appeared in the final exam of market mechanism design. And I didn’t figure it out during then💔. The original question is from lecture note of 21 Algorithmic Game Theory, instructed by Michael Dinitz. background Consider combinatorial auction allocating $m$ items to $n$ players. Outcome is each bidder get a set $S_i\subset [m], \forall i \in [n]$ and they don’t overlap. Valuation: in this question we consider Single-Minded bidders....