A Comparison of Two Algorithms for Clearing Multi-unit Bid Double Auctions
No Thumbnail Available
Files
Date
2003-01-06
Authors
Journal Title
Series/Report No.
Journal ISSN
Volume Title
Publisher
Abstract
Auctions have rapidly achieved a prominent position as an online revenue model. As the number and diversity of participants grow, the complexity of choosing an efficient allocation mechanism for a specific situation increases. One aspect of running online auctions is the algorithms used by the auction server to manage bids. In this paper, we present two algorithms. We discuss how these two algorithms expedite the negotiations between buyers and sellers and under which situations they can achieve an efficient allocation for goods and services.
Description
Keywords
E-commerce, Double Auctions, Multi-unit Bids, Algorithms
Citation
Degree
MS
Discipline
Computer Science