Optimal clearing algorithms for multi-unit single item and multi-unit combinatorial auctions with demand/supply function bidding

摘要

This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexity of our algorithms and prove that they are guaranteed to find the optimal allocation.