AN EFFIEICNT WINNER DETERMINATION ALGOLITHM FOR COMBINATORIAL ASCENDING AUCIONS

概要

論文の詳細を見る
In this paper we study combinatorial auctions where bidders can quote for a combination of the objects being sold. In a previous article we have proposed a combinatorial ascending auction where the bidders can place a bit at an arbitrary timing via the Internet. For combinatorial auctions, computational complexity increases exponentially as the number of possible combination increases. Although some algorithms for reducing the complexity have been proposed, they are only suitable for the one-shot auctions where bidders submit bids only once simultaneously. Thus, we can improve the performance by making use of the previous valuation for doing next valuation. In this paper we propose a method to reduce computational burden for combinatorial ascending auctions and verify the effectiveness of the algorithm through the evaluation.
一般社団法人情報処理学会の論文
2002-03-28