A comparison of two algorithms for multi-unit k-double auctions

We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The first algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a novel algorithm based on the Internal Path Reduction tree. To facilitate the generation of price quotes, we enhance the IPR tree algorithm to maintain information about the current Mth and (M + 1)st units. Our experiments show that when bids are relatively unordered, AUCIPR outperforms 4-HEAP by a factor of about 2.5. However, under some scenarios in which bids are received in order, AUC-IPR is not always better than 4-HEAP.

• Type: Conference
• Year: 2003
• Where: ACMICEC
• Authors: Shengli Bao, Peter R. Wurman
• Keywords: ACMICEC 2003, Algorithm, ECommerce, IPR Tree Algorithm, Multi-unit Double Auctions