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

E-commerce;Double Auctions;Multi-unit Bids;Algorithms

Bao, Shengli ; Rada Y. Chirkova, Committee Member,Peter R. Wurman, Committee Chair,Munindar P. Singh, Committee Member,Bao, Shengli ; Rada Y. Chirkova ; Committee Member ; Peter R. Wurman ; Committee Chair ; Munindar P. Singh ; Committee Member

University:North Carolina State University

关键词: E-commerce;    Double Auctions;    Multi-unit Bids;    Algorithms;   

Others  :  https://repository.lib.ncsu.edu/bitstream/handle/1840.16/566/etd.pdf?sequence=1&isAllowed=y

美国|英语

来源: null

【 摘 要 】

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.