A Comparison of Two Algorithms for Clearing Multi-unit Bid Double Auctions

Show full item record

Title: A Comparison of Two Algorithms for Clearing Multi-unit Bid Double Auctions
Author: Bao, Shengli
Advisors: Rada Y. Chirkova, Committee Member
Peter R. Wurman, Committee Chair
Munindar P. Singh, Committee Member
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.
Date: 2003-01-06
Degree: MS
Discipline: Computer Science
URI: http://www.lib.ncsu.edu/resolver/1840.16/566


Files in this item

Files Size Format View
etd.pdf 381.8Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record