File organization and processing
File organization and processing
Flexible double auctions for electionic commerce: theory and implementation
Decision Support Systems - Special issue on economics of electronic commerce
Balancing binary trees by internal path reduction
Communications of the ACM
Extracting collective probabilistic forecasts from web games
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
DyMRA: dynamic market deployment for decentralized resource allocation
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
| Hi-index | 0.00 |
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, AUC-IPR outperforms 4-HEAP by a factor of about 2.6. However, under some scenarios in which bids are received in order, AUC-IPR is not always better than 4-HEAP.