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. Keywords Auctions, Winner Determination, Intelligent Agents

• Type: Conference
• Year: 2003
• Where: ACMICEC
• Authors: Viet Dung Dang, Nicholas R. Jennings
• Keywords: ACMICEC 2003, ECommerce, Keywords Auctions, Linear Demand/supply Functions, Multi-Unit Combinatorial Auctions