Optimal Multi-unit Combinatorial Auctions with Single Minded Bidders

The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (single minded bidders). This paper extends the current art by proposing an optimal auction for procuring multiple units of multiple items when the bidders are single minded. We develop a procurement auction that minimizes the cost of procurement while satisfying Bayesian incentive compatibility and interim individual rationality. Under appropriate regularity conditions, this optimal auction also satisfies dominant strategy incentive compatibility. The results presented here hold true for equivalent forward auction settings as well.