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